Pages that link to "Item:Q1908815"
From MaRDI portal
The following pages link to Some remarks on lengths of propositional proofs (Q1908815):
Displayed 7 items.
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- 2002 Annual Meeting of the Association for Symbolic Logic (Q4432543) (← links)
- The cost of a cycle is a square (Q4532599) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)