Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

Journal of Computer and System Sciences

Volumn 45, Issue 2, 1992, Pages 204-232

  Babai, László ^a,b   Nisan, Noam ^c   Szegedy, Márió ^d  

^a UNIVERSITY OF CHICAGO   (United States)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; RANDOM PROCESSES; TURING MACHINES;

MULTIPARTY PROTOCOLS; PSEUDORANDOM GENERATORS; TIME-SPACE TRADEOFFS;

COMPUTATION THEORY;

EID: 0026940019     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(92)90047-M     Document Type: Article

References (34)

1. Random walks, universal traversing sequences and the complexity of maze problems
2. Meanders, Ramsey theory and lower bounds for branching programs
3. On notions of information transfer in VLSI circuits
4. Deterministic simulation of probabilistic constant depth circuits]
5. Two applications of complementation via inductive counting
6. Complexity classes in communication complexity theory
7. How to generate cryptographically strong sequences of pseudo random bits
8. Multiparty protocols
9. The Recognition Problem for the Set of Perfect Squares
10. Unbiased bits from sources of weak randomness and probabilistic communication complexity
11. A time-space tradeoff for language recognition
12. Nondeterministic linear time tasks may require substantially nonlinear deterministic time in the case of sublinear work space
13. On the power of small depth threshold circuits
14. Pseudorandom generation from one-way functions
15. Polynomial universal traversing sequences for cycles are constructible
16. Two time-space tradeoffs for element distinctness
17. On the cover time of random walks in graphs
18. O(logn) for cliques
19. A boolean function
20. On read-once vs multiple access to randomness in Logspace
21. Pseudorandom generators for space-bounded computation
22. Pseudorandom bits for constant depth circuits
23. Hardness vs. randomness
24. Towards a Theory of Parallel Randomized Computation
25. Equations over Finite Fields, An Elementary Approach
26. Strong communication complexity or generating quasi-random sequences from two communicating semirandom sources
27. Some complexity questions related to distributive computing
28. Theory and applications of trapdoor functions
29. Lower bounds by probabilistic arguments
30. On ACC and threshold circuits