scientific article
From MaRDI portal
Publication:3072543
zbMath1219.03071MaRDI QIDQ3072543
Publication date: 4 February 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models of arithmetic and set theory (03C62) Complexity of proofs (03F20)
Related Items (18)
Feasible Interpolation for QBF Resolution Calculi ⋮ INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH ⋮ Typical forcings, NP search problems and an extension of a theorem of Riis ⋮ Zero knowledge and circuit minimization ⋮ Characterizing Propositional Proofs as Noncommutative Formulas ⋮ A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝 Frege systems] ⋮ NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN ⋮ A saturation property of structures obtained by forcing with a compact family of random variables ⋮ Towards NP-P via proof complexity and search ⋮ A remark on pseudo proof systems and hard instances of the satisfiability problem ⋮ ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Partially definable forcing and bounded arithmetic ⋮ CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS ⋮ Feasibly constructive proofs of succinct weak circuit lower bounds ⋮ Unnamed Item ⋮ Polynomial time ultrapowers and the consistency of circuit lower bounds ⋮ Unnamed Item
This page was built for publication:
