The following pages link to (Q4737899):
Displaying 13 items.
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- (Q5092479) (← links)
- (Q5146113) (← links)
- Exploiting Symmetry in SMT Problems (Q5200027) (← links)
- On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (Q5278196) (← links)
- Propositional proof complexity (Q6064569) (← links)
