N. Segerlind, S. Buss, R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF Resolution. 43th IEEE Symposium on Foundations of Computer Science, FOCS 2002, pp. 604--614. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
....e#cient proofs of NP P poly. Similar results hold also for the system PCR (the natural common extension of Polynomial Calculus and Resolution) when the characteristic of the ground field is di#erent from 2. As a by product, we also improve on the small restriction switching lemma from [SBI02] by removing a square root from the final bound. This in particular implies that the (moderately) weak pigeonhole principle PHP n is hard for Res(# log n log log n) # Institute for Advanced Study, Princeton, US, on leave from Steklov Mathematical Institute, Moscow, Russia, ....
....n to n bits) is hard not only for Resolution but also for its extension PCR (Theorem 2. 19) These results were proved independently of [Kra02] the proof method uses the resolution width PC degree bounds from [ABRW00] cited above in combination with the machinery from the recent paper [SBI02] based upon the so called small restriction switching lemma. In order to bring these two together, we also introduce a special kind of random restrictions specifically tailored to deal with Nisan generators. Then, using a very simple reduction, we show that our generator is not only hard for ....
[Article contains additional citation context not shown here]
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.
Memoization and DPLL: Formula Caching Proof Systems - Paul Beame Computer (2003) Self-citation (Segerlind Impagliazzo) (Correct)
No context found.
N. Segerlind, S. Buss, and R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF resolution. In Proceedings 43nd Annual Symposium on Foundations of Computer Science, Vancouver, BC, November 2002. IEEE.
Separation Results for the Size of Constant-Depth.. - Beckmann, Buss (2004) Self-citation (Buss) (Correct)
No context found.
Nathan Segerlind, Samuel R. Buss, and Russell Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF resolution. In Proc. 43rd IEEE Symp. of Foundations of Computer Science (FOCS'02), pages 604--613, 2002.
A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (5 citations) Self-citation (Segerlind Buss Impagliazzo) (Correct)
No context found.
N. Segerlind, S. Buss, and R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-dnf resolution. In Forty-third Annual Symposium on Foundations of Computer Science, pages 604--613. IEEE, 2002.
On the Complexity of Resolution with Bounded Conjunctions - Esteban, Galesi, Messner (2004) (5 citations) (Correct)
No context found.
N. Segerlind, S. Buss, R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF Resolution. 43th IEEE Symposium on Foundations of Computer Science, FOCS 2002, pp. 604--614.
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial .. - Razborov (2003) (7 citations) (Correct)
No context found.
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.
On the Automatizability of Resolution and Related.. - Atserias, Bonet (2003) (8 citations) (Correct)
No context found.
N. Segerlind, S. Buss, and R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF resolution. In 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 604--614, 2002. 21
An Optimal Lower Bound for Resolution with - Conjunctions Jan Johannsen (Correct)
No context found.
N. Segerlind, S. R. Buss, and R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF resolution. Submitted for publication, 2002.
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