CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
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.
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.
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
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.
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.
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.
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.
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.