The following pages link to Proof Complexity (Q4629797):
Displaying 20 items.
- Proof complexity of modal resolution (Q832717) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Lower bounds for QCDCL via formula gauge (Q2118284) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- A simple proof of QBF hardness (Q2656352) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)
- (Q5028438) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- (Q5092460) (← links)
- NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043) (← links)
- Short refutations for an equivalence‐chain principle for constant‐depth formulas (Q5109242) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
- ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS (Q6204144) (← links)
