Pages that link to "Item:Q687506"
From MaRDI portal
The following pages link to Exponential lower bounds for the pigeonhole principle (Q687506):
Displayed 19 items.
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
- Simplified lower bounds for propositional proofs (Q1374208) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- An exponential separation between the parity principle and the pigeonhole principle (Q1923563) (← links)
- Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079) (← links)
- Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- LA, permutations, and the Hajós calculus (Q2581274) (← links)
- A form of feasible interpolation for constant depth Frege systems (Q3570172) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Witnessing functions in bounded arithmetic and search problems (Q4227882) (← links)
- Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings (Q4527935) (← links)
- Approximate Euler characteristic, dimension, and weak pigeonhole principles (Q5311719) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- A new proof of the weak pigeonhole principle (Q5894824) (← links)