On a criterion of NP-completeness

被引：0

作者：

Bulitko V.K. ^{[1
]}

Bulitko V.V. ^{[1
]}

机构：

[1] Odessa University, Odessa

来源：

Ukrainian Mathematical Journal | 1998年 / 50卷 / 12期

关键词：

Recursive Function; Computable Enumeration; Mass Problem; Algorithmic Language; Associate Polynomial;

D O I：

10.1007/BF02514208

中图分类号：

学科分类号：

摘要：

We consider the problem of construction of criteria of completeness of sets with respect to polynomially bounded reducibilities. We present a nonstandard description of sets from the class NP, a brief proof of an analog of the well-known Cook theorem, and a criterion of NP-completeness. © 1999 Kluwer Academic/Plenum Publishers.

引用

页码：1924 / 1928

共 50 条

[11] NP-completeness of the game Kingdomino™
Viet-Ha Nguyen
Perrot, Kevin
Vallet, Mathieu
THEORETICAL COMPUTER SCIENCE, 2020, 822 : 23 - 35
[12] ON NP-COMPLETENESS IN LINEAR LOGIC
KOPYLOV, AP
ANNALS OF PURE AND APPLIED LOGIC, 1995, 75 (1-2) : 137 - 152
[13] NP-COMPLETENESS AND DEGREES OF SATISFACTION
LIEBERHERR, K
JOURNAL OF SYMBOLIC LOGIC, 1977, 42 (03) : 457 - 457
[14] NP-completeness in hedonic games
Ballester, C
GAMES AND ECONOMIC BEHAVIOR, 2004, 49 (01) : 1 - 30
[15] Nonuniform Reductions and NP-Completeness
John M. Hitchcock
Hadi Shafei
Theory of Computing Systems, 2022, 66 : 743 - 757
[16] Nonuniform Reductions and NP-Completeness
Hitchcock, John M.
Shafei, Hadi
THEORY OF COMPUTING SYSTEMS, 2022, 66 (04) : 743 - 757
[17] Query order and NP-completeness
Dai, JJ
Lutz, JH
FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 142 - 148
[18] Nonuniform Reductions and NP-Completeness
Hitchcock, John M.
Shafei, Hadi
35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
[19] NP-Completeness in the gossip monoid
Fenner, Peter
Johnson, Marianne
Kambites, Mark
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2018, 28 (04) : 653 - 672
[20] AN ELEMENTARY APPROACH TO NP-COMPLETENESS
AUSTIN, AK
AMERICAN MATHEMATICAL MONTHLY, 1983, 90 (06): : 398 - 399

← 1 2 3 4 5 →