Pseudorandom Generators in Propositional Proof Complexity

Submitted by smcneil on Mon, 2012-01-16 00:00
Author: 
M. Alekhnovitch
E. Ben-Sasson
A. Razborov
A. Wigderson
Publication: 
Society for Industrial and Applied Mathematics (SIAM) Journal on Computing, vol. 34, no. 1, pp. 67-88, 2004. Preliminary version appeared in Symposium on Theory of Computing (STOC) 2000.
Year: 
2004
Abstract: 
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/abrw01.pdf
Hide Files
File: 
Journal version (pdf)
Journal version (ps)
bibTeX