Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Distributionally-hard languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...