PROBLEM OF LOWER BOUNDS OF COMPLEXITY AND THE NP-COMPLETENESS THEORY

被引：0

|

作者：

NIGMATULLIN, RG

机构：

来源：

IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA | 1981年 / 05期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：17 / 25

页数：9

相关论文

共 50 条

[1] SUBPROBLEMS AND NP-COMPLETENESS THEORY
Su, Li Sek
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2006, (90): : 192 - 198
[2] The NP-completeness of the Road Coloring Problem
Roman, Adam
INFORMATION PROCESSING LETTERS, 2011, 111 (07) : 342 - 347
[3] NP-COMPLETENESS OF BANDWIDTH MINIMIZATION PROBLEM
PAPADIMITRIOU, CH
COMPUTING, 1976, 16 (03) : 263 - 270
[4] NP-COMPLETENESS OF THE HAMMING SALESMAN PROBLEM
ERNVALL, J
KATAJAINEN, J
PENTTONEN, M
BIT, 1985, 25 (01): : 289 - 292
[5] NP-COMPLETENESS
SCHNEIER, B
DR DOBBS JOURNAL, 1994, 19 (10): : 119 - 121
[6] Np-completeness and bounds for disjunctive total domination subdivision
Ciftci, Canan
Aytac, Aysun
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2025, 49 (01)
[7] NP-COMPLETENESS OF THE LINEAR COMPLEMENTARITY-PROBLEM
CHUNG, SJ
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1989, 60 (03) : 393 - 399
[8] Strong NP-completeness of a matrix similarity problem
Brimkov, V
Codenotti, B
Leoncini, M
Resta, G
THEORETICAL COMPUTER SCIENCE, 1996, 165 (02) : 483 - 490
[9] TRAHTENBROT-ZYKOV PROBLEM AND NP-COMPLETENESS
BUGATA, P
DISCRETE MATHEMATICS, 1992, 108 (1-3) : 253 - 259
[10] The NP-Completeness Column
Johnson, David S.
ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (01) : 160 - 176

← 1 2 3 4 5 →