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 条
  • [1] On the knowledge complexity of NP
    Petrank, E
    Tardos, G
    COMBINATORICA, 2002, 22 (01) : 83 - 121
  • [2] On P, NP, and Computational Complexity
    Vardi, Moshe Y.
    COMMUNICATIONS OF THE ACM, 2010, 53 (11) : 5 - 5
  • [3] The relative complexity of NP search problems
    Beame, P
    Cook, S
    Edmonds, J
    Impagliazzo, R
    Pitassi, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (01) : 3 - 19
  • [4] Computational complexity and knowledge complexity
    Goldreich, O
    Ostrovsky, R
    Petrank, E
    SIAM JOURNAL ON COMPUTING, 1998, 27 (04) : 1116 - 1141
  • [5] On the P versus NP intersected with co-NP question in communication complexity
    Jukna, S
    INFORMATION PROCESSING LETTERS, 2005, 96 (06) : 202 - 206
  • [6] Knowledge and complexity
    Allen, PM
    Torrens, PM
    FUTURES, 2005, 37 (07) : 581 - 584
  • [7] Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
    Freitag, Cody
    Paneth, Omer
    Pass, Rafael
    ADVANCES IN CRYPTOLOGY, PT IV, EUROCRYPT 2024, 2024, 14654 : 112 - 141
  • [8] ON THE STRUCTURE OF SETS IN NP AND OTHER COMPLEXITY CLASSES
    LANDWEBER, LH
    LIPTON, RJ
    ROBERTSON, EL
    THEORETICAL COMPUTER SCIENCE, 1981, 15 (02) : 181 - 200
  • [9] The Parameterized Complexity of Reasoning Problems Beyond NP
    de Haan, Ronald
    Szeider, Stefan
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 82 - 91
  • [10] Inverse monoids associated with the complexity class NP
    Birget, J. C.
    SEMIGROUP FORUM, 2019, 98 (02) : 369 - 397
12345