Keyword

depth-3 circuits

Description: Boolean circuits with three computational layers of gates, studied in theoretical computer science and circuit complexity.
OpenAlex ID: keywords/depth-3-circuits
2001 · Russell Impagliazzo, Ramamohan Paturi, et al. · Journal of Computer and System Sciences · 1,891
2002 · R. Impagliazzo, R. Paturi, et al. · Annual Symposium on Foundations of Computer Science · 200
2002 · R. Paturi, P. Pudlak, et al. · Annual Symposium on Foundations of Computer Science · 191
2005 · Ran Raz, Amir Shpilka · Computational Complexity · 185
2008 · Nitin Saxena · Lecture notes in computer science · 90
1993 · Alexander Razborov, Avi Wigderson · Information Processing Letters · 89
2016 · Ankit Gupta, Pritish Kamath, et al. · SIAM Journal on Computing · 70
2010 · Ran Raz · Theory of Computing · 66
2012 · Nitin Saxena, C. Seshadhri · SIAM Journal on Computing · 63
2005 · Zeev Dvir, Amir Shpilka · ACM Symposium on Theory of Computing (STOC) · 57
2012 · Manindra Agrawal, Chandan Saha, et al. · ACM Symposium on Theory of Computing (STOC) · 55
2009 · Emanuele Viola · Computational Complexity · 52
2011 · Shpilka, Amir, Forbes, Michael A. · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 46
2016 · Gil Cohen, Igor Shinkar · Conference on Innovations in Theoretical Computer Science · 42
2010 · Nitin Saxena, C. Seshadhri · Annual Symposium on Foundations of Computer Science · 38
2002 · Amir Shpilka · Journal of Computer and System Sciences · 38
1993 · Dima Grigoriev, Marek Karpinski · Lecture notes in computer science · 38
2011 · Nitin Saxena, C. Seshadhri · SIAM Journal on Computing · 37
2012 · Chandan Saha, Ramprasad Saptharishi, et al. · Computational Complexity · 36
2019 · Yu Yu, Jiang Zhang, et al. · Lecture notes in computer science · 35
2018 · Efremenko, Klim, Garg, Ankit, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 29
2016 · Alexander A. Sherstov · SIAM Journal on Computing · 29
Works count: 121
Citation count: 4,145
Year
Topic
Type