The following pages link to (Q4218929):
Displaying 18 items.
- Parameterized proof complexity (Q451111) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Space bounds for resolution (Q1854472) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- On the Relative Strength of Pebbling and Resolution (Q2946664) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- (Q5092479) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- A new proof of the weak pigeonhole principle (Q5894824) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Unit read-once refutations for systems of difference constraints (Q6174656) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
