Pages that link to "Item:Q3775553"
From MaRDI portal
The following pages link to Polynomial size proofs of the propositional pigeonhole principle (Q3775553):
Displayed 50 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- Extension without cut (Q714731) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Proof compressions with circuit-structured substitutions (Q843604) (← links)
- A lower bound for intuitionistic logic (Q876385) (← links)
- Resolution proofs of generalized pigeonhole principles (Q920967) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- Propositional consistency proofs (Q1177033) (← links)
- Simplification in a satisfiability checker for VLSI applications (Q1312163) (← links)
- A lower bound for tree resolution (Q1336637) (← links)
- ALOGTIME and a conjecture of S. A. Cook (Q1353980) (← 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)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- Cutting planes, connectivity, and threshold logic (Q1908818) (← links)
- An exponential separation between the parity principle and the pigeonhole principle (Q1923563) (← links)
- Short resolution proofs for a sequence of tricky formulas (Q1924995) (← links)
- A bounded arithmetic AID for Frege systems (Q1977488) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Synthetic tableaux: Minimal tableau search heuristics (Q2104533) (← links)
- A modal view on resource-bounded propositional logics (Q2157601) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
- Proofs with monotone cuts (Q2888631) (← links)
- Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (Q3012837) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- A Measure of Logical Inference and Its Game Theoretical Applications (Q3094002) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Exploiting Symmetry in SMT Problems (Q5200027) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)