Nathan Segerlind, Sam Buss, Russell Impagliazzo  Home/Search
Context Related
| ucsd.edu/~sbuss/ResearchWeb...focs02.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/~sbuss/ResearchW...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 Res(k) propositional proof system, an extension of resolution which works with k-DNFs instead of clauses. We also obtain an exponential separation between depth d circuits of k + 1. (Update)
Cited by: More
On the Complexity of Resolution with Bounded Conjunctions - Esteban, Galesi, Messner (2004) (Correct)
Memoization and DPLL: Formula Caching Proof Systems - Paul Beame Computer (2003) (Correct)
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (Correct)
Similar documents (at the sentence level):
37.5%: A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (Correct)
Active bibliography (related documents): More All
1.8: A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (Correct)
0.6: Bounded-depth Frege lower bounds for weaker pigeonhole.. - Buresh-Oppenheim.. (Correct)
0.6: On Resolution Complexity of Matching Principles - Dantchev (2002) (Correct)
Similar documents based on text: More All
0.2: Improved Resolution Lower Bounds for the Weak Pigeonhole Principle - Razborov (2001) (Correct)
0.2: Approximate Euler characteristic, dimension, - And Weak Pigeonhole (Correct)
0.1: Improved Depth Lower Bounds for Small Distance Connectivity - Beame, Impagliazzo, al. (1995) (Correct)
Related documents from co-citation: More All
5: Short proofs are narrow - resolution made simple (context) - Ben-Sasson, Wigderson - 2001
4: the weak pigeonhole principle (context) - Krajcek - 2001
4: A new proof of the weak pigeonhole principle - Maciel, Pitassi et al. - 1999
BibTeX entry: (Update)
N. Segerlind, S. Buss, and R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF resolution. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 604--613, 2002. http://citeseer.ist.psu.edu/article/segerlind02switching.html More
@misc{ segerlind02switching,
author = "N. Segerlind and S. Buss and R. Impagliazzo",
title = "A switching lemma for small restrictions and lower bounds for k-DNF resolution",
text = "N. Segerlind, S. Buss, and R. Impagliazzo. A switching lemma for small
restrictions and lower bounds for k-DNF resolution. In Proceedings of the
43rd IEEE Symposium on Foundations of Computer Science, pages 604--613,
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/segerlind02switching.html" }
Citations (may not include all citations):291 Theoretical Computer Science (context) - Haken, of - 1985
121 Hard examples for resolution (context) - Urquhart - 1987
84 Mathematical Systems Theory (context) - Furst, Saxe et al. - 1984
72 Many hard examples for resolution (context) - atal, edi - 1988
55 Short proofs are narrow --- resolution made simple (context) - Ben-Sasson, Wigderson - 2001
54 Resolution proofs of generalized pigeonhole principles (context) - Buss, an - 1988
48 Borel sets and circuit complexity (context) - Sipser - 1983
47 Annals of Pure and Applied Logic (context) - Ajtai, nite - 1983
28 Propositional Logic and Complexity Theory (context) - cek, Arithmetic - 1995
27 Simplied and improved resolution lower bounds (context) - Beame, Pitassi - 1996
25 Almost optimal lower bounds for small depth circuits (context) - astad - 1989
25 Almost optimal lower bounds for small depth circuits (context) - astad - 1986
23 Resolution lower bounds for the weak pigeonhole principle - Raz - 2002
19 A new proof of the weak pigeonhole principle - Maciel, Pitassi et al. - 2000
16 Propositional proof complexity: Past (context) - Beame, Pitassi - 1998
14 The lengths of proofs (context) - ak - 1998
13 Unrestricted resolution versus Nresolution (context) - Goerdt - 1990
12 the automatizability of resolution and related propositional.. - Atserias, Bonet - 2002
12 Regular resolution lower bounds for the weak pigeonhole prin.. - Pitassi, Raz - 2001
12 Hard examples for bounded depth frege (context) - Ben-Sasson - 2002
12 A study of proof search algorithms for resolution and polyno.. (context) - Bonet, Galesi - 1999
11 The complexity of - nite functions (context) - Boppana, Sipser - 1990
10 the complexity of proofs in propositional logics (context) - Tseitin - 1970
9 Improved resolution lower bounds for the weak pigeonhole pri.. - Razborov - 2001
6 Lower bounds for the weak pigeonhole principle beyond resolu.. - Atserias, Bonet et al. - 2076
6 the complexity of resolution with bounded conjunctions - Esteban, Galesi et al. - 2002
6 Circuit bottom fan-in and computational power - Cai, Chen et al. - 1998
6 the complexity of unsatisability proofs for random kCNF form.. (context) - Beame, Karp et al. - 1998
5 Tree resolution proofs of the weak pigeon-hole principle (context) - Dantchev, Riis - 2001
4 Department of Computer Science and Engineering (context) - Beame, lemma et al. - 1994
1 The relative efciency of propositional proof systems (context) - Cook, Reckhow - 1979
1 the weak pigeonhole principle (context) - cek - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://euclid.ucsd.edu/~sbuss/ResearchWeb/resK/index.html):
A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC