On the knowledge complexity of NP

被引：0

|

作者：

Petrank, E ^{[1
]}

Tardos, G ^{[1
]}

机构：

[1] DIMACS CTR,PISCATAWAY,NJ 08855

来源：

37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1996年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：494 / 503

页数：10

相关论文

共 50 条

[21] PLATO ON KNOWLEDGE AND REALITY - WHITE,NP
BURNYEAT, MF
PHILOSOPHICAL REVIEW, 1978, 87 (04): : 635 - 639
[22] PLATO ON KNOWLEDGE AND REALITY - WHITE,NP
不详
REVIEW OF METAPHYSICS, 1977, 31 (01): : 128 - 130
[23] PLATO ON KNOWLEDGE AND REALITY - WHITE,NP
DEVRIES, GJ
MNEMOSYNE, 1979, 32 (3-4) : 410 - 411
[24] On the (Non) NP-Hardness of Computing Circuit Complexity
Murray, Cody D.
Williams, R. Ryan
30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 365 - 380
[25] On P vs. NP and Geometric Complexity Theory
Mulmuley, Ketan D.
JOURNAL OF THE ACM, 2011, 58 (02)
[26] Parameterized complexity classes beyond para-NP
de Haan, Ronald
Szeider, Stefan
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 87 : 16 - 57
[27] ON CIRCUIT-SIZE COMPLEXITY AND THE LOW HIERARCHY IN NP
KO, KI
SCHONING, U
SIAM JOURNAL ON COMPUTING, 1985, 14 (01) : 41 - 51
[28] On the (Non) NP-Hardness of Computing Circuit Complexity
Murray, Cody D.
Williams, R. Ryan
THEORY OF COMPUTING, 2017, 13 : 1 - 22
[29] COMPLEXITY AND LIMITS TO KNOWLEDGE
YATES, FE
AMERICAN JOURNAL OF PHYSIOLOGY, 1978, 235 (05): : R201 - R204
[30] Quantifying knowledge complexity
O. Goldreich
E. Petrank
computational complexity, 1999, 8 : 50 - 98

← 1 2 3 4 5 →