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 条
  • [21] Time-space efficient regression testing for configurable systems
    Souto, Sabrina
    d'Amorim, Marcelo
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2018, 137 : 733 - 746
  • [22] THE TIME-SPACE ORGANIZATION OF CELL SYSTEMS IN HEALTH AND DISEASE
    ROMANOV, YA
    MARKINA, VV
    SAVCHENKO, TV
    [J]. VESTNIK AKADEMII MEDITSINSKIKH NAUK SSSR, 1990, (02): : 27 - &
  • [23] A SIMPLE PROOF OF A TIME-SPACE TRADE-OFF FOR SORTING WITH LINEAR COMPARISONS
    JOHNSON, DB
    [J]. THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) : 345 - 350
  • [24] The time-space of craftsmanship
    Eriksson, Lars
    Seiler, Joakim
    Jarefjall, Patrik
    Almevik, Gunnar
    [J]. CRAFT RESEARCH, 2019, 10 (01) : 17 - 39
  • [25] Time-Space Fluctuations
    Miguel, Alcebiades Diniz
    [J]. ARQUIVO MAARAVI-REVISTA DIGITAL DE ESTUDOS JUDAICOS DA UFMG, 2013, 7 (13) : 3 - 16
  • [26] ECONOMIC TIME-SPACE
    HRUBY, P
    [J]. POLITICKA EKONOMIE, 1970, 18 (08) : 735 - 742
  • [27] Time and Space Complexity for Splicing Systems
    Loos, Remco
    Ogihara, Mitsunori
    [J]. THEORY OF COMPUTING SYSTEMS, 2010, 47 (02) : 301 - 316
  • [28] Time and Space Complexity for Splicing Systems
    Remco Loos
    Mitsunori Ogihara
    [J]. Theory of Computing Systems, 2010, 47 : 301 - 316
  • [29] A traffic model of optical networks based on time-space complexity and traffic grooming
    赵永利
    [J]. High Technology Letters, 2009, 15 (02) : 198 - 202
  • [30] Temporal partitioning for image processing based on time-space complexity in reconfigurable architectures
    Brandao do Nascimento, Paulo S.
    Eusebio de Lima, Manoel
    [J]. 2006 DESIGN AUTOMATION AND TEST IN EUROPE, VOLS 1-3, PROCEEDINGS, 2006, : 373 - +
12345