Circuit Complexity
Circuit Complexity is a branch of computational complexity theory that classifies computational problems according to the size and depth of Boolean circuits required to solve them, distinguishing it from other complexity measures by focusing on non-uniform models of computation.
3.3K
Publications
180.2K
Citations
5.1K
Authors
1.4K
Institutions
Publications per year
2017–2026
523
Parents
3.3K
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
Combinational profiles of sequential benchmark circuits
F. Brglez, D. Bryan, Krzysztof Koźmiński · 2003 · 2.1K citations
Boosting a Weak Learning Algorithm by Majority
Yoav Freund · Information and Computation · 1995 · 1.7K citations
Improved simulation of stabilizer circuits
Scott Aaronson, Daniel Gottesman · Physical Review A · 2004 · 1.6K citations · Full text
1–5 of 3.3K
5.1K
28
h-index
25
h-index
21
h-index
20
h-index
18
h-index
1–5 of 5.1K
1.4K
Massachusetts Institute of Technology
Cambridge, United States
40 h-index
141 publications
49.5K citations
University of California, Berkeley
Berkeley, United States
39 h-index
141 publications
14.1K citations
University of California San Diego
San Diego, United States
37 h-index
110 publications
9.4K citations
University of Michigan
Ann Arbor, United States
35 h-index
117 publications
10.5K citations
Stanford University
Stanford, United States
33 h-index
87 publications
5.7K citations

University of Waterloo
Waterloo, Canada
30 h-index
75 publications
5.3K citations
Princeton University
Princeton, United States
29 h-index
73 publications
4K citations

University of Toronto
Toronto, Canada
28 h-index
96 publications
5K citations
1–8 of 1.4K
143 publications · 12K citations
55
h-index
122 publications · 9.2K citations
46
h-index
124 publications · 7.1K citations
43
h-index
59 publications · 2.3K citations
26
h-index
37 publications · 4.6K citations
25
h-index
1–5