ACM Symposium on Theory of Computing, STOC 2014


Article Details
Title: On derandomizing algorithms that err extremely rarely
Article URLs:
Alternative Article URLs:
Authors: Oded Goldreich
  • Weizmann Institute of Science Rehovot, Israel, Department of Computer Science
Avi Wigderson
  • Princeton, School of Mathematics Institute for Advanced Study
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/GoldreichW14
Author Comments:

Discuss this paper and its artifacts below