Nathan Segerlind

Available identifiers

zbMath Open segerlind.nathanMaRDI QIDQ835025

List of research outcomes

Publication	Date of Publication	Type
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures	2019-05-06	Paper
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations	2017-07-12	Paper
Formula Caching in DPLL	2015-09-24	Paper
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures	2012-05-30	Paper
Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\)	2009-08-27	Paper
Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity	2008-06-19	Paper
The Complexity of Propositional Proofs	2008-02-25	Paper
A strong direct product theorem for corruption and the multiparty communication complexity of disjointness	2007-11-14	Paper
Automata, Languages and Programming	2006-01-10	Paper
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution	2005-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4737158	2004-08-11	Paper

Research outcomes over time

This page was built for person: Nathan Segerlind