The following pages link to (Q3072543):
Displaying 21 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- A saturation property of structures obtained by forcing with a compact family of random variables (Q1935366) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Polynomial time ultrapowers and the consistency of circuit lower bounds (Q2288334) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 (Q3011106) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- The Complexity of Propositional Proofs (Q4873893) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- (Q5092472) (← links)
- NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043) (← links)
- A remark on pseudo proof systems and hard instances of the satisfiability problem (Q5109236) (← links)
- (Q5121893) (← links)
- CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS (Q5739904) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)
- Extended Nullstellensatz proof systems (Q6621298) (← links)
