Pseudorandom generators in propositional proof complexity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 43-53

  Alekhnovich, Michael ^a   Ben Sasson, Eli ^b   Razborov, Alexander A ^c   Wigderson, Avi ^b,d  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^d INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; RANDOM NUMBER GENERATION; THEOREM PROVING;

PROPOSITIONAL PROOF COMPLEXITY; PSEUDORANDOM GENERATORS;

COMPUTER SCIENCE;

EID: 0034497113     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892064     Document Type: Article

References (29)

1. M. Alekhnovich E. Ben-Sasson A. Razborov A. Wigderson Space complexity in propositional calculus Proceedings of the 32st ACM Symposium on Theory of Computing 358 367 Proceedings of the 32st ACM Symposium on Theory of Computing 2000
2. M. Ajtai Σ11-formulae on finite structures Annals of Pure and Applied Logic 24 1 48 May 1983
3. N. Alon Lecture Notes in Computer Science 1380 206 215 1998 Springer-Verlag Berlin Spectral techniques in graph algorithms
4. S. Buss D. Grigoriev R. Impagliazzo T. Pitassi Linear gaps between degrees for the Polynomial Calculus modulo distinct primes Proceedings of the 31st ACM STOC 547 556 Proceedings of the 31st ACM STOC 1999
5. P. Beame T. Pitassi Simplified and improved resolution lower bounds Proceedings of the 37th IEEE FOCS 274 282 Proceedings of the 37th IEEE FOCS 1996
6. P. Beame T. Pitassi Propositional proof complexity: Past, present and future 1998 TR98-067 Electronic Colloquium on Computational Complexity
7. P. Beame M. Saks J. S. Thathachar Time-space tradeoffs for branching programs Proceedings of the 39th IEEE FOCS 254 263 Proceedings of the 39th IEEE FOCS 1998
8. E. Ben-Sasson A. Wigderson Short proofs are narrow-resolution made simple Proceedings of the 31st ACM STOC 517 526 Proceedings of the 31st ACM STOC 1999
9. V. Chvátal E. Szemerédi Many hard examples for resolution Journal of the ACM 35 4 759 768 October 1988
10. M. Clegg J. Edmonds R. Impagliazzo Using the Groebner basis algorithm to find proofs of unsatisfiability Proceedings of the 28th ACM STOC 174 183 Proceedings of the 28th ACM STOC 1996
11. M. Furst J. B. Saxe M. Sipser Parity, circuits and the polynomial time hierarchy Math. Syst. Theory 17 13 27 1984
12. D. Grigoriev Tseitin's tautologies and lower bounds for nullstellensatz proofs Proceedings of the 39th IEEE FOCS 648 652 Proceedings of the 39th IEEE FOCS 1998
13. A. Haken The intractability or resolution Theoretical Computer Science 39 297 308 1985
14. J. Håstad Computational limitations on Small Depth Circuits 1986
15. R. Impagliazzo P. Pudlák J. Sgall Lower bounds for the polynomial calculus and the Groebner basis algorithm Computational Complexity 8 2 127 144 1999
16. N. Nisan Pseudo-random bits for constant-depth circuits Combinatorica 11 1 63 70 1991
17. N. Nisan A. Wigderson Hardness vs. randomness Journal of Computer and System Sciences 49 2 149 167 October 1994
18. P. Pudlák R. Impagliazzo A lower bound for DLL algorithms for k-SAT Proceedings of the 11th Symposium on Discrete Algorithms 128 136 Proceedings of the 11th Symposium on Discrete Algorithms 2000
19. A. Razborov Arithmetic, Proof Theory and Computational Complexity 247 277 1992 Oxford University Press An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic
20. A. Razborov Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic Izvestiya of the RAN 59 1 201 222 1995
21. A. Razborov Lower bounds for propositional proofs and independence results in Bounded Arithmetic Proceedings of the 23rd ICALP, Lecture Notes in Computer Science 1099 48 62 Proceedings of the 23rd ICALP, Lecture Notes in Computer Science New York/Berlin 1996
22. A. Razborov Lower bounds for the polynomial calculus Computational Complexity 7 291 324 1998
23. A. Razborov S. Rudich Natural proofs Journal of Computer and System Sciences 55 1 24 35 1997
24. G. C. Tseitin Studies in mathematics and mathematical logic 115 125 On the complexity of derivations in propositional calculus
25. A. Urquhart Hard examples for resolution Journal of the ACM 34 1 209 219 1987
26. A. Yao Theory and applications of trapdoor functions Proceedings of the 23rd IEEE FOCS 92 99 Proceedings of the 23rd IEEE FOCS 1982
27. A. Yao Separating the polynomial-time hierarchy by oracles Proceedings of the 26th IEEE FOCS 1 10 Proceedings of the 26th IEEE FOCS 1985