Pages that link to "Item:Q5894824"
From MaRDI portal
The following pages link to A new proof of the weak pigeonhole principle (Q5894824):
Displayed 12 items.
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Upper and lower Ramsey bounds in bounded arithmetic (Q2488271) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- Approximate counting by hashing in bounded arithmetic (Q3399180) (← links)
- The polynomial and linear hierarchies in models where the weak pigeonhole principle fails (Q3503756) (← links)
- Abelian groups and quadratic residues in weak arithmetic (Q3566945) (← links)
- NP search problems in low fragments of bounded arithmetic (Q5294030) (← links)
- Approximate counting in bounded arithmetic (Q5422312) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)