Lower bounds for k-DNF resolution on random 3-CNFs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Eulogy: Michael (Misha) Alekhnovich 1978-2006
ACM SIGACT News
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Elusive functions and lower bounds for arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Complexity of propositional proofs under a promise
ACM Transactions on Computational Logic (TOCL)
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic (TOCL)
Algebraic proofs over noncommutative formulas
Information and Computation
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Algebraic proofs over noncommutative formulas
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Complexity of semialgebraic proofs with restricted degree of falsity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A dichotomy for local small-bias generators
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We call a pseudorandom generator $G_n:\{0,1\}^n\to \{0,1\}^m$ hard for a propositional proof system P if P cannot efficiently prove the (properly encoded) statement $G_n(x_1,\ldots,x_n)\neq b$ for any string $b\in\{0,1\}^m$. We consider a variety of "combinatorial" pseudorandom generators inspired by the Nisan--Wigderson generator on the 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).