The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nathan Segerlind: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Russell Impagliazzo, Nathan Segerlind
    Counting Axioms Do Not Polynomially Simulate Counting Gates. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:200-209 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. Nathan Segerlind
    Exponential separation between Res(k) and Res(k+1) for k leq varepsilonlogn. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:4, pp:185-190 [Journal]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]

  15. On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs. [Citation Graph (, )][DBLP]


  16. Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. [Citation Graph (, )][DBLP]


  17. The Complexity of Propositional Proofs. [Citation Graph (, )][DBLP]


  18. Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability. [Citation Graph (, )][DBLP]


  19. On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs. [Citation Graph (, )][DBLP]


  20. Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver procedures. [Citation Graph (, )][DBLP]


  21. Formula Caching in DPLL. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002