
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
Pseudorandom generators in propositional proof complexity
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
M. Alekhnovich, E. BenSasson, A.A. Razborov, A. Wigderson, "Pseudorandom generators in propositional proof complexity," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 43, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892064, author = {M. Alekhnovich and E. BenSasson and A.A. Razborov and A. Wigderson}, title = {Pseudorandom generators in propositional proof complexity}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {43}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892064}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Pseudorandom generators in propositional proof complexity SN  02725428 SP EP A1  M. Alekhnovich, A1  E. BenSasson, A1  A.A. Razborov, A1  A. Wigderson, PY  2000 KW  theorem proving; computational complexity; process algebra; random processes; pseudorandom generators; propositional proof complexity; combinatorial pseudorandom generators; NisanWigderson generator; Tseitin tautologies; resolution; polynomial calculus with resolution; polynomial calculus VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
We call a pseudorandom generator G/sub n/:{0,1}/sup n//spl rarr/{0,1}/sup m/ hard for a propositional proof system P if P can not efficiently prove the (properly encoded) statement G/sub n/(x/sub 1/,...,x/sub n/)/spl ne/b for any string b/spl epsiv/{0,1}/sup m/. We consider a variety of "combinatorial" pseudorandom generators inspired by the NisanWigderson generator on one hand, and by the construction of Tseitin tautologies on the other. We prove that under certain circumstances these generators are hard for such proof systems as resolution, polynomial calculus and polynomial calculus with resolution (PCR).
Index Terms:
theorem proving; computational complexity; process algebra; random processes; pseudorandom generators; propositional proof complexity; combinatorial pseudorandom generators; NisanWigderson generator; Tseitin tautologies; resolution; polynomial calculus with resolution; polynomial calculus
Citation:
M. Alekhnovich, E. BenSasson, A.A. Razborov, A. Wigderson, "Pseudorandom generators in propositional proof complexity," focs, pp.43, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.