Keyword

Boolean circuit complexity

Description: Boolean circuit complexity studies the resources, such as circuit size or depth, required to compute Boolean functions using logical circuits.
OpenAlex ID: keywords/boolean-circuit-complexity
1987 · R. Smolensky · ACM Symposium on Theory of Computing (STOC) · 985
2000 · Ingo Wegener · Society for Industrial and Applied Mathematics eBooks · 630
2012 · Stasys Jukna · Algorithms and combinatorics · 520
2005 · Springer eBooks · 401
1986 · Paul W. Beame, Stephen A. Cook, et al. · SIAM Journal on Computing · 260
1983 · Michael Sipser · ACM Symposium on Theory of Computing (STOC) · 226
1994 · Richard Beigel, Jun Tarui · Computational Complexity · 219
2002 · A.C.-C. Yao · Annual Symposium on Foundations of Computer Science · 217
1992 · Ran Raz, Avi Wigderson · Journal of the ACM · 194
1999 · Ran Raz, Pierre McKenzie · COMBINATORICA · 181
1998 · Johan HÅ stad · SIAM Journal on Computing · 174
2004 · Emil Jeřábek · Annals of Pure and Applied Logic · 150
1996 · V.Y. Pan · Computers & Mathematics with Applications · 144
1995 · Alexander A. Razborov · Birkhäuser Boston eBooks · 141
2022 · Yiding Hao, Dana Angluin, et al. · Transactions of the Association for Computational Linguistics · 127
2009 · Satyanarayana V. Lokam · Foundations and Trends® in Theoretical Computer Science · 122
2008 · Benjamin Rossman · ACM Symposium on Theory of Computing (STOC) · 120
1993 · Alexander Razborov, Avi Wigderson · Information Processing Letters · 89
1997 · Matthias Krause, Pavel Pudlák · Theoretical Computer Science · 82
2003 · Leslie G. Valiant · Journal of the ACM · 79
1986 · M Ajtai, L Babai, et al. · ACM Symposium on Theory of Computing (STOC) · 75
2014 · Ryan Williams · ACM Symposium on Theory of Computing (STOC) · 73
2007 · Søren Riis · The Electronic Journal of Combinatorics · 73
Works count: 460
Citation count: 9,898
Year
Topic
Type