Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Authors:
- László BabaiLBLászló Babai
- Noam NisantNNNoam Nisant
- Márió SzegedyMSMárió Szegedy
- 1 October 1992
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 45 (2) , 204-232
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Pseudorandom bits for constant depth circuitsCombinatorica, 1991
- On the cover time of random walks on graphsJournal of Theoretical Probability, 1989
- Universal traversal sequences of length nO(log n) for cliquesInformation Processing Letters, 1988
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sourcesCombinatorica, 1987
- Two time-space tradeoffs for element distinctnessTheoretical Computer Science, 1986
- A time-space tradeoff for language recognitionTheory of Computing Systems, 1984
- The recognition problem for the set of perfect squares7th Annual Symposium on Switching and Automata Theory (swat 1966), 1966