THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS

被引：1639

作者：

GOLDWASSER, S ^{[1
]}

MICALI, S ^{[1
]}

RACKOFF, C ^{[1
]}

机构：

[1] UNIV TORONTO,DEPT COMP SCI,TORONTO M5S 1A4,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1137/0218012

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：186 / 208

页数：23

共 35 条

[1]

AIELLO B, 1987, 28TH P ANN IEEE S F, P439

[2]

Aiello W., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P368, DOI 10.1109/SFCS.1986.36

[3]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[4]

BABAI L, 1975, 17TH STOC, P421

[5]

BABAI L, 25TH P ANN IEEE S F, P229

[6]

Babai Laszlo, 1985, ACM S THEORY COMPUTI, P421, DOI DOI 10.1145/22145.22192

[7]

BENOR M, IN PRESS P CRYPTO 88

[8]

Blum M., 1982, IEEE COMPCON, P133

[9] DOES CO-NP HAVE SHORT INTERACTIVE PROOFS [J].

BOPPANA, RB ;

HASTAD, J ;

ZACHOS, S .

[10]

BRASSARD G, 1986, 27TH P ANN IEEE S F