BPHSPACE(S) ⊆ DSPACE(S3/2)

Journal of Computer and System Sciences

Volumn 58, Issue 2, 1999, Pages 376-403

  Saks, Michael ^a   Zhou, Shiyu ^b,c  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Matrix exponentiation; Pseudo random generator; Space bounded computation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERROR ANALYSIS; MATRIX ALGEBRA; RANDOM PROCESSES; SET THEORY;

PSEUDO-RANDOM GENERATORS; RECURSIVE ALGORITHM;

COMPUTER SCIENCE;

EID: 0032621057     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1616     Document Type: Article

References (18)

1. [AKLLR79] R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Rackoff, Random walks, universal sequences and the complexity of maze problems, in "20th IEEE Symposium on Foundations of Computer Science, 1979," pp. 218-223.
2. [AK87] M. Ajtai, J. Komlós, and E. Szemerédi, Deterministic simulation of logspace, in "Proc. 19th ACM Symposium on Theory of Computing, 1987," pp. 132-140.
3. [AO94] E. Allender and M. Ogihara, Relationships among PL, #L, and the determinant, in "Proc. 9th Conference on Structure in Complexity Theory, 1994," pp. 267-279.
4. [BNS89] L. Babai, N. Nisan, and M. Szegedy, Multiparty protocols and logspace-hard pseudo-random sequences, in "Proc. 21st ACM Symposium on Theory of Computing, 1989".
5. [BCP83] A. Borodin, S. Cook, N. Pippenger, Parallel computation and well-endowed rings and space-bounded probabilistic machines, Inform. and Control 58 (1983), 113-136.
6. [CG86] B. Chor and O. Goldreich, On the power of two point based sampling, J. Complexity 5 (1989), 96-106.
7. [CW79] L. Carter and M. Wegman, Universal hash functions, J. Comput. System Sci. 18, No. 2 (1979), 143-154.
8. [Gil77] J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Computing 6 (1977), 675-695.
9. [Jun81] H. Jung, Relationships between probabilistic and deterministic tape complexity, in "10th Symposium on Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, Vol. 118, pp. 339-346, Springer-Verlag, New York/Berlin, 1900.
10. [LP82] H. Lewis and C. Papadimitiou, Symmetric space-bounded computation, Theoretical Computer Science 19 (1982), 161-187.
11. [LN86.] R. Lidl and H. Niederreiter, "Introduction to Finite Fields and Their Applications," Cambridge Univ. Press, Cambridge, 1986.
12. [Nis90] N. Nisan, Pseudorandom generators for space-bounded computation, in "Proc. 22nd ACM Symposium on Theory of Computing, 1990," pp. 204-212.
13. [Nis92] N. Nisan, RL ⊆ SC, in "Proc. ACM Symposium on Theory of Computing," pp. 619-623, 1992.
14. 1.5 n) space, 1992, in "Proc. 30th Symposium on Foundations of Computer Science," pp. 248-253.
15. [NZ93] N. Nisan and D. Zuckerman, More deterministic simulation in logspace, in "Proc. 25th ACM Symposium on Theory of Computing, 1993," pp. 235-244.
16. [Pap94.] C. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
17. [Sak96] M. Saks, Randomization and derandomization in space-bounded computation, in "11th Annual Conference on Computational Complexity, 1996".
18. [Sav70] W. J. Savitch, Relationships between nondeterministic and deterministic space complexities, J. Comput. System Sci. 4, No. 2 (1970), 177-192.