Pages that link to "Item:Q1343166"
From MaRDI portal
The following pages link to The complexity of the pigeonhole principle (Q1343166):
Displayed 21 items.
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
- Simplified lower bounds for propositional proofs (Q1374208) (← links)
- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- Bounds in the theory of finite covers (Q1604371) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- An exponential separation between the parity principle and the pigeonhole principle (Q1923563) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Covered clauses are not propagation redundant (Q2096437) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Random resolution refutations (Q2311546) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- A generalization of the second incompleteness theorem and some exceptions to it (Q2500470) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)