Randomization and derandomization in space-bounded computation

被引：29
|
作者：
Saks, M [1 ]
机构：
[1] RUTGERS STATE UNIV,DEPT MATH,NEW BRUNSWICK,NJ 08903
来源：
ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS | 1996年
关键词：
D O I：
10.1109/CCC.1996.507676
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：128 / 149
页数：22
相关论文
共 50 条
  • [41] Non-Malleable Codes for Space-Bounded Tampering
    Faust, Sebastian
    Hostakova, Kristina
    Mukherjee, Pratyay
    Venturi, Daniele
    ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PART II, 2017, 10402 : 95 - 126
  • [42] ON SEVERAL KINDS OF SPACE-BOUNDED ONLINE MULTICOUNTER AUTOMATA
    VOELKEL, L
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 465 - 473
  • [43] Time-bounded and space-bounded sensing in wireless sensor networks
    Saukh, Olga
    Sauter, Robert
    Marron, Pedro Jose
    DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, 2008, 5067 : 357 - 371
  • [44] SPACE-BOUNDED COMPLEXITY CLASSES AND ITERATED DETERMINISTIC SUBSTITUTION
    ASVELD, PRJ
    INFORMATION AND CONTROL, 1980, 44 (03): : 282 - 299
  • [45] Alternation for sublogarithmic space-bounded alternating pushdown automata
    Xu, JL
    Yoshinaga, T
    Inoue, K
    Wang, Y
    Ito, A
    THEORETICAL COMPUTER SCIENCE, 2001, 259 (1-2) : 475 - 492
  • [46] ON SPACE-BOUNDED SYNCHRONIZED ALTERNATING TURING-MACHINES
    IBARRA, OH
    TRAN, NQ
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 248 - 257
  • [47] SPACE-BOUNDED SIMULATION OF MULTITAPE TURING-MACHINES
    ADLEMAN, LM
    LOUI, MC
    MATHEMATICAL SYSTEMS THEORY, 1981, 14 (03): : 215 - 222
  • [48] Trial and error - A new approach to space-bounded learning
    Ameur, F
    Fischer, P
    Hoffgen, KU
    Heide, FMAD
    ACTA INFORMATICA, 1996, 33 (07) : 621 - 630
  • [49] ON LANGUAGES WITH VERY HIGH SPACE-BOUNDED KOLMOGOROV COMPLEXITY
    BOOK, RV
    LUTZ, JH
    SIAM JOURNAL ON COMPUTING, 1993, 22 (02) : 395 - 402
  • [50] ON SPACE-BOUNDED SYNCHRONIZED ALTERNATING TURING-MACHINES
    IBARRA, OH
    TRAN, NQ
    THEORETICAL COMPUTER SCIENCE, 1992, 99 (02) : 243 - 264
12345