The SCEAS System
| |||||||

## Search the dblp DataBase
Nathan Segerlind:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
**Memoization and DPLL: Formula Caching Proof Systems.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:248-0 [Conf] - Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
**A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:52-66 [Conf] - Russell Impagliazzo, Nathan Segerlind
**Counting Axioms Do Not Polynomially Simulate Counting Gates.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:200-209 [Conf] - Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo
**A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:604-0 [Conf] - Paul Beame, Toniann Pitassi, Nathan Segerlind
**Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1176-1188 [Conf] - Russell Impagliazzo, Nathan Segerlind
**Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:208-219 [Conf] - Russell Impagliazzo, Nathan Segerlind
**Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Paul Beame, Toniann Pitassi, Nathan Segerlind
**Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:053, pp:- [Journal] - Nathan Segerlind
**Exponential separation between Res(**[Citation Graph (0, 0)][DBLP]*k*) and Res(*k*+1) for*k*leq varepsilonlog*n*. Inf. Process. Lett., 2005, v:93, n:4, pp:185-190 [Journal] - Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo
**A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:5, pp:1171-1200 [Journal] - Russell Impagliazzo, Nathan Segerlind
**Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations.**[Citation Graph (0, 0)][DBLP] ACM Trans. Comput. Log., 2006, v:7, n:2, pp:199-218 [Journal] - Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
**A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2006, v:15, n:4, pp:391-432 [Journal] - Nathan Segerlind
**Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Paul Beame, Toniann Pitassi, Nathan Segerlind
**Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:845-869 [Journal] **On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs.**[Citation Graph (, )][DBLP]**Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures.**[Citation Graph (, )][DBLP]**The Complexity of Propositional Proofs.**[Citation Graph (, )][DBLP]**Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability.**[Citation Graph (, )][DBLP]**On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs.**[Citation Graph (, )][DBLP]**Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver procedures.**[Citation Graph (, )][DBLP]**Formula Caching in DPLL.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |