INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE COMPLEXITY

被引：0
|
作者：
FORTNOW, L
LUND, C
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 480卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We show a rough equivalence between alternating time-space complexity and a public-coin interactive proof system with the verifier having a polynomial related time-space complexity. Special cases include All of NC has interactive proofs with a log-space polynomial-time public-coin verifier vastly improving the best previous lower bound of LOGCFL for this model [8]. All languages in P have interactive proofs with a polynomial-time public-coin verifier using omicron(log2 n) space. All exponential-time languages have interactive proof systems with public-coin polynomial-space exponential-time verifiers.
引用
收藏
页码：263 / 274
页数：12
相关论文
共 50 条
  • [1] INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE COMPLEXITY
    FORTNOW, L
    LUND, C
    [J]. THEORETICAL COMPUTER SCIENCE, 1993, 113 (01) : 55 - 73
  • [2] THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS
    GOLDWASSER, S
    MICALI, S
    RACKOFF, C
    [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
    Trinh Huynh
    Nordstrom, Jakob
    [J]. STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 233 - 247
  • [4] On the time-space complexity of geometric elimination procedures
    Heintz, J
    Matera, G
    Waissbein, A
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 11 (04) : 239 - 296
  • [5] Time-Space Complexity Advantages for Quantum Computing
    Zheng, Shenggen
    Qiu, Daowen
    Gruska, Jozef
    [J]. THEORY AND PRACTICE OF NATURAL COMPUTING, TPNC 2017, 2017, 10687 : 305 - 317
  • [6] Time-space tradeoffs in algebraic complexity theory
    Aldaz, M
    Heintz, J
    Matera, G
    Montaña, JL
    Pardo, LM
    [J]. JOURNAL OF COMPLEXITY, 2000, 16 (01) : 2 - 49
  • [7] Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes
    Liskiewicz, M
    [J]. STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 129 - 140
  • [8] A NOTE ON THE DENSITY OF ORACLE DECREASING TIME-SPACE COMPLEXITY
    DURIS, P
    ROLIM, JDP
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 435 - 444
  • [9] ON THE TIME-SPACE COMPLEXITY OF REACHABILITY QUERIES FOR PREPROCESSED GRAPHS
    HELLERSTEIN, L
    KLEIN, P
    WILBER, R
    [J]. INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 261 - 267
  • [10] Implicit computational complexity and the exponential time-space classes
    Caporaso, Salvatore
    Covino, Emanuele
    Gissi, Paolo
    Pani, Giovanni
    [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 - +
12345