Keyword

AC0 circuits

Description: AC0 circuits are constant-depth Boolean circuits of polynomial size with unbounded-fan-in AND and OR gates, studied in computational complexity.
OpenAlex ID: keywords/ac0-circuits
1994 · J. Aspnes, R. Beigel, et al. · COMBINATORICA · 175
2010 · Sebastian Faust, Tal Rabin, et al. · Lecture notes in computer science · 145
2018 · R. Ryan Williams · SIAM Journal on Computing · 135
2008 · Mark Braverman · Journal of the ACM · 117
2012 · Russell Impagliazzo, William Matthews, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 116
2020 · Elette Boyle, Geoffroy Couteau, et al. · Annual Symposium on Foundations of Computer Science · 114
1996 · Rajeev Raman · Lecture notes in computer science · 107
2016 · Josh Alman, Timothy M. Chan, et al. · Annual Symposium on Foundations of Computer Science · 106
2017 · Tal, Avishay · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 101
2010 · Russell Impagliazzo, Ragesh Jaiswal, et al. · SIAM Journal on Computing · 82
2013 · Jonathan Ullman · ACM Symposium on Theory of Computing (STOC) · 80
2002 · R. Beigel, N. Reingold, et al. · Structure in Complexity Theory Annual Conference · 78
1991 · Merrick L. Furst, Jeffrey C. Jackson, et al. · Elsevier eBooks · 78
2014 · Adi Akavia, Andrej Bogdanov, et al. · Conference on Innovations in Theoretical Computer Science · 76
2011 · Emanuele Viola · SIAM Journal on Computing · 75
2014 · Emanuele Viola · COMBINATORICA · 73
2014 · Benjamin Rossman · SIAM Journal on Computing · 67
2009 · Alexander Razborov · ACM Transactions on Computation Theory · 67
2002 · Jeffrey C. Jackson, Adam R. Klivans, et al. · ACM Symposium on Theory of Computing (STOC) · 67
1993 · Jun Tarui · Theoretical Computer Science · 65
2011 · Shachar Lovett, Emanuele Viola · Computational Complexity · 62
2015 · Ruiwen Chen, Valentine Kabanets, et al. · Computational Complexity · 61
2009 · Mark Braverman · IEEE Conference on Computational Complexity (CCC) · 61
2005 · E. Viola · IEEE Conference on Computational Complexity (CCC) · 57
2013 · Luca Trevisan, Tongke Xue · IEEE Conference on Computational Complexity (CCC) · 56
Works count: 247
Citation count: 4,473
Year
Topic
Type