Nathan Segerlind

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 ACM Transactions on Computational Logic	2017-07-12	Paper
Formula Caching in DPLL ACM Transactions on Computation Theory	2015-09-24	Paper
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures SIAM Journal on Computing	2012-05-30	Paper
Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) Information Processing Letters	2009-08-27	Paper
Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity SIAM Journal on Computing	2008-06-19	Paper
The Complexity of Propositional Proofs The Bulletin of Symbolic Logic	2008-02-25	Paper
A strong direct product theorem for corruption and the multiparty communication complexity of disjointness Computational Complexity	2007-11-14	Paper
Automata, Languages and Programming Lecture Notes in Computer Science	2006-01-10	Paper
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution SIAM Journal on Computing	2005-02-21	Paper
scientific article; zbMATH DE number 2086623 (Why is no real title available?)	2004-08-11	Paper

Research outcomes over time

This page was built for person: Nathan Segerlind