Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Natural proofs versus derandomization

Natural proofs versus derandomization http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings of the forty-fifth annual ACM symposium on Theory of Computing Unpaywall

Natural proofs versus derandomization

Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingJun 1, 2013

Natural proofs versus derandomization

Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingJun 1, 2013

Loading next page...
 
/lp/unpaywall/natural-proofs-versus-derandomization-ccoyWwb0K1

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Unpaywall
DOI
10.1145/2488608.2488612
Publisher site
See Article on Publisher Site

Abstract

Journal

Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingUnpaywall

Published: Jun 1, 2013

There are no references for this article.