Pages that link to "Item:Q1923563"
From MaRDI portal
The following pages link to An exponential separation between the parity principle and the pigeonhole principle (Q1923563):
Displayed 20 items.
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- An exponential separation between the parity principle and the pigeonhole principle (Q1923563) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Space proof complexity for random 3-CNFs (Q2013560) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- On transformations of constant depth propositional proofs (Q2311211) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Width versus size in resolution proofs (Q2382288) (← 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)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- (Q4993272) (← links)
- (Q5136303) (← links)