Proof Complexity
From MaRDI portal
Publication:4629797
DOI10.1017/9781108242066OpenAlexW4211118908MaRDI QIDQ4629797
Publication date: 28 March 2019
Full work available at URL: https://doi.org/10.1017/9781108242066
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (20)
Proof complexity of modal resolution ⋮ On the complexity of finding shortest variable disjunction branch-and-bound proofs ⋮ A simple proof of QBF hardness ⋮ INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH ⋮ NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN ⋮ Short refutations for an equivalence‐chain principle for constant‐depth formulas ⋮ Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution ⋮ Towards Uniform Certification in QBF ⋮ Space characterizations of complexity measures and size-space trade-offs in propositional proof systems ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS ⋮ The canonical pairs of bounded depth Frege systems ⋮ Unnamed Item ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ Unnamed Item ⋮ Proof complexity of substructural logics ⋮ Propositional proof complexity ⋮ On the proof complexity of logics of bounded branching ⋮ Substitution and Propositional Proof Complexity ⋮ Lower bounds for QCDCL via formula gauge
This page was built for publication: Proof Complexity
