Pages that link to "Item:Q5894824"

The following pages link to A new proof of the weak pigeonhole principle (Q5894824):

Displaying 24 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)
• Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
• The treewidth of proofs (Q2013559) (← links)
• Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
• Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← 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)
• Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
• Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← 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)
• Expander Construction in VNC1 (Q4638081) (← links)
• Approximate counting and NP search problems (Q5055313) (← links)
• Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
• On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (Q5278196) (← 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)
• LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)
• Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)