Pages that link to "Item:Q2344736"
From MaRDI portal
The following pages link to Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736):
Displaying 12 items.
- Short proofs of the pigeonhole formulas based on the connection method (Q915494) (← links)
- A parity-based Frege proof for the symmetric pigeonhole principle (Q1317976) (← links)
- Count\((q)\) versus the pigeon-hole principle (Q1360313) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
- QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS (Q3188337) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle (Q4847394) (← links)
- An induction principle and pigeonhole principles for K-finite sets (Q4876318) (← links)
- Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
