#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1999

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to DNFs with small terms. We use this to prove lower bounds for the Res(k)… (More)

- Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
- computational complexity
- 2006

We prove that two-party randomized communication complexity satisfies a strong direct product property, so long as the communication lower bound is proved by a “corruption” or “one-sided discrepancy”… (More)

- Paul Beame, Toniann Pitassi, Nathan Segerlind
- Electronic Colloquium on Computational Complexity
- 2005

We prove that an ω(log n) lower bound for the three-party number-on-the-forehead (NOF) communication complexity of the set-disjointness function implies an n size lower bound for tree-like… (More)

- Nathan Segerlind
- 2008 23rd Annual IEEE Conference on Computational…
- 2007

We show that tree-like OBDD proofs of unsatisfiability require an exponential increase (s rarr 2s Omega(1)) in proof size to simulate unrestricted resolution, and that unrestricted OBDD proofs of… (More)

- Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
- IEEE Conference on Computational Complexity
- 2003

A fruitful connection between algorithm design and proof complexity is the formalization of the approach to satisfiability testing in terms of tree-like resolution proofs. We consider extensions of… (More)

- Nathan Segerlind, Toniann Pitassi
- Electronic Colloquium on Computational Complexity
- 2007

The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-one programs by the addition of new linear inequalities. We address the question of how many new… (More)

- Nathan Segerlind
- Bulletin of Symbolic Logic
- 2007

Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have… (More)

- Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
- 20th Annual IEEE Conference on Computational…
- 2005

We prove that corruption, one of the most powerful measures used to analyze 2-party randomized communication complexity, satisfies a strong direct sum property under rectangular distributions. This… (More)

We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and is applicable to DNFs with small conjunctions. We use this to prove lower bounds for the… (More)

- Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
- Electronic Colloquium on Computational Complexity
- 2006

We consider extensions of the DPLL approach to satisfiability testing that add a version of memoization, in which formulas that the algorithm has previously shown to be unsatisfiable are remembered… (More)