Keyword

switching lemma

Description: A combinatorial theorem in theoretical computer science that bounds how Boolean functions or formulas behave under random restrictions or related transformations.
Wikidata ID: wiki/Q7659119
OpenAlex ID: keywords/switching-lemma
1993 · Toniann Pitassi, Paul Beame, et al. · Computational Complexity · 231
1992 · Paul Beame, Russell Impagliazzo, et al. · ACM Symposium on Theory of Computing (STOC) · 118
2004 · Nathan Segerlind, Sam Buss, et al. · SIAM Journal on Computing · 89
1995 · Sóstenes Lins · Series on knots and everything · 86
2005 · Catuscia Palamidessi · Springer eBooks · 81
2007 · Emanuele Viola · SIAM Journal on Computing · 73
2014 · Charanjit S. Jutla, Arnab Roy · Lecture notes in computer science · 70
2008 · Wilfried Imrich, Janja Jerebic, et al. · European Journal of Combinatorics · 58
2013 · Luca Trevisan, Tongke Xue · IEEE Conference on Computational Complexity (CCC) · 56
2003 · Guy Kindler, Muli Safra · 56
2001 · M. Agrawal, E. Allender, et al. · Computational Complexity · 45
1996 · Xudong Fu, Alasdair Urquhart · Notre Dame Journal of Formal Logic · 44
1997 · Paul Beame, Soren Riis · DIMACS series in discrete mathematics and theoretical computer science · 38
2005 · Michael Alekhnovich · ACM Symposium on Theory of Computing (STOC) · 37
2016 · Toniann Pitassi, Benjamin Rossman, et al. · ACM Symposium on Theory of Computing (STOC) · 33
2011 · Emanuele Viola · Computational Complexity · 33
2010 · Nicholas Crawford, Dmitry Ioffe · Communications in Mathematical Physics · 31
2012 · Chris Beck, Russell Impagliazzo, et al. · Annual Symposium on Foundations of Computer Science · 30
2003 · Nathan Segerlind, Samuel R. Buss, et al. · 29
2016 · Gopalan, Parikshit, Servedio, Rocco A., et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 27
1997 · Mikael Goldmann · Information Processing Letters · 27
2001 · Adam R. Klivans · Lecture notes in computer science · 26
2022 · Shuichi Hirahara, Mikito Nanashima · Annual Symposium on Foundations of Computer Science · 22
2003 · N. Segerlind, S. Buss, et al. · Annual Symposium on Foundations of Computer Science · 21
1998 · P. Beame, R. Impagliazzo, et al. · Computational Complexity · 20
Works count: 104
Citation count: 1,731
Year
Topic
Type