On the knowledge complexity of NP

被引：0

作者：

Petrank, E ^{[1
]}

Tardos, G ^{[1
]}

机构：

[1] DIMACS CTR,PISCATAWAY,NJ 08855

来源：

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：494 / 503

页数：10

共 50 条

[31] KNOWLEDGE MANAGEMENT AND COMPLEXITY
Neto, Ivan Rocha
REVISTA DE GESTAO E PROJETOS, 2012, 3 (01): : 94 - 126
[32] Quantifying knowledge complexity
Goldreich, O
Petrank, E
COMPUTATIONAL COMPLEXITY, 1999, 8 (01) : 50 - 98
[33] The complexity of zero knowledge
Vadhan, Salil
FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 52 - 70
[34] The complexity of knowledge representation
Papadimitriou, CH
ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1996, : 244 - 248
[35] Complexity and the limits to knowledge
Ormerod, P
FUTURES, 2005, 37 (07) : 721 - 728
[36] Complexity and technologization of knowledge
Cevolini, Alberto
BIBLIOFILIA, 2016, 118 (02): : 283 - 313
[37] Pluralism and the complexity of knowledge
De Marchi, B
POLITICS AND THE LIFE SCIENCES, 1999, 18 (02) : 208 - 210
[38] Resettable Statistical Zero-Knowledge for NP
Kiyoshima, Susumu
ADVANCES IN CRYPTOLOGY - CRYPTO 2024, PT IX, 2024, 14928 : 288 - 320
[39] Round-optimal zero-knowledge proofs of knowledge for NP
Li HongDa
Feng DengGuo
Li Bao
Xue HaiXia
SCIENCE CHINA-INFORMATION SCIENCES, 2012, 55 (11) : 2473 - 2484
[40] Round-optimal zero-knowledge proofs of knowledge for NP
HongDa Li
DengGuo Feng
Bao Li
HaiXia Xue
Science China Information Sciences, 2012, 55 : 2473 - 2484