SPACE-BOUNDED PROBABILISTIC GAME AUTOMATA

被引:11
|
作者
CONDON, A [1 ]
机构
[1] UNIV WASHINGTON,SEATTLE,WA 98195
关键词
THEORY; ARTHUR-MERLIN GAMES; INTERACTIVE PROOF SYSTEMS; PROBABILISTIC GAME AUTOMATA;
D O I
10.1145/103516.128681
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
New results on the power of space-bounded probabilistic game automata are presented. Space-bounded analogues of Arthur-Merlin games and interactive proof systems, which are denoted by BC and BP respectively, for Bounded random game automata with Complete and Partial information, are considered. The main results are that BC-SPACE(s(n)) sub-set-or-equal-to BP-SPACE(log s(n)) for s(n) = OMEGA(n), union-c DTIME(2cs(n)) = BC-SPACE(s(n)) for s(n) = OMEGA(log n), where s(n) is space constructible. A consequence of these results is that any language recognizable in deterministic exponential time has an interactive proof that uses only logarithmic space. The power of games with simultaneous time and space bounds is also studied, and it is shown that any language in BC-TIME(t(n)) has an interactive proof that uses time polynominal in t(n) but space only logarithmic in t(n).
引用
收藏
页码:472 / 494
页数:23
相关论文
共 50 条
  • [1] SPACE-BOUNDED HIERARCHIES AND PROBABILISTIC COMPUTATIONS
    RUZZO, WL
    SIMON, J
    TOMPA, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) : 216 - 230
  • [2] ON SEVERAL KINDS OF SPACE-BOUNDED ONLINE MULTICOUNTER AUTOMATA
    VOELKEL, L
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 465 - 473
  • [3] Deterministic amplification of space-bounded probabilistic algorithms
    Bar-Yossef, Z
    Goldreich, O
    Wigderson, A
    [J]. FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 188 - 198
  • [4] Alternation for sublogarithmic space-bounded alternating pushdown automata
    Xu, JL
    Yoshinaga, T
    Inoue, K
    Wang, Y
    Ito, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 259 (1-2) : 475 - 492
  • [5] On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape
    Mandal, Debasis
    Pavan, A.
    Vinodchandran, N. V.
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 459 - 471
  • [6] PARALLEL COMPUTATION FOR WELL-ENDOWED RINGS AND SPACE-BOUNDED PROBABILISTIC MACHINES
    BORODIN, A
    COOK, S
    PIPPENGER, N
    [J]. INFORMATION AND CONTROL, 1983, 58 (1-3): : 113 - 136
  • [7] Reversibility in space-bounded computation
    Morita, Kenichi
    [J]. INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2014, 43 (07) : 697 - 712
  • [8] SYMMETRIC SPACE-BOUNDED COMPUTATION
    LEWIS, HR
    PAPADIMITRIOU, CH
    [J]. THEORETICAL COMPUTER SCIENCE, 1982, 19 (02) : 161 - 187
  • [9] HALTING SPACE-BOUNDED COMPUTATIONS
    SIPSER, M
    [J]. THEORETICAL COMPUTER SCIENCE, 1980, 10 (03) : 335 - 338
  • [10] Space-bounded quantum complexity
    Watrous, J
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 59 (02) : 281 - 326