Skip to main content
Avi Wigderson
Personal
CV
Short CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
Do probabilistic algorithms outperform deterministic ones?
Submitted by
smcneil
on Tue, 2013-03-12 14:30
Author:
A. Wigderson
Publication:
International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 1443, pp. 212-214, 1998.
Year:
1998
Files
File:
Proceedings Version (pdf)
‹ Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
up
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes ›