The following pages link to Nathan Segerlind (Q835025):
Displaying 11 items.
- Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) (Q835026) (← links)
- A strong direct product theorem for corruption and the multiparty communication complexity of disjointness (Q2460032) (← links)
- Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász–Schrijver Procedures (Q2884578) (← links)
- Formula Caching in DPLL (Q2947546) (← links)
- Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (Q3507523) (← links)
- (Q4633844) (← links)
- A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution (Q4651510) (← links)
- (Q4737158) (← links)
- Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations (Q5277746) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Automata, Languages and Programming (Q5716863) (← links)
