共 50 条
- [2] THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS [J]. SIAM JOURNAL ON COMPUTING, 1989, 18 (01) : 186 - 208
- [3] On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [J]. STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 233 - 247
- [5] Time-Space Complexity Advantages for Quantum Computing [J]. THEORY AND PRACTICE OF NATURAL COMPUTING, TPNC 2017, 2017, 10687 : 305 - 317
- [7] Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes [J]. STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 129 - 140
- [10] Implicit computational complexity and the exponential time-space classes [J]. PROCEEDINGS OF THE 6TH WSEAS INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND INFORMATICS (TELE-INFO '07)/ 6TH WSEAS INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING (SIP '07), 2007, : 65 - +