Bounded-depth Circuits
Bounded-Depth Circuits is a Boolean circuit model belonging to the class of computational circuits characterized by a constant depth independent of input size, distinguished by its restriction on the number of sequential layers of logic gates, thereby limiting computational parallelism and typically used to study the complexity of problems within subclasses of P.
136
Publications
7.9K
Citations
227
Authors
121
Institutions
Publications per year
2017–2026
16
Variants
Bounded-depth Circuit
Parents
136
Almost optimal lower bounds for small depth circuits
Johan Håstad · 1986 · 630 citations
Walter L. Ruzzo · Journal of Computer and System Sciences · 1981 · 434 citations
Quantum advantage with shallow circuits
Sergey Bravyi, David Gosset, Robert König · Science · 2018 · 424 citations · Full text
1–5 of 136
227
Czech Academy of Sciences, Institute of Mathematics, Czechia
7 publications · 511 citations
7
h-index
6
h-index
6
h-index
5
h-index
4
h-index
1–5 of 227
121
University of California San Diego
San Diego, United States
10 h-index
15 publications
513 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
10 publications
310 citations
Czech Academy of Sciences, Institute of Mathematics
Prague, Czechia
6 h-index
8 publications
238 citations
IBM (United States)
Armonk, United States
5 h-index
10 publications
629 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
5 h-index
6 publications
257 citations
Princeton University
Princeton, United States
5 h-index
5 publications
184 citations
Microsoft (United States)
Redmond, United States
4 h-index
10 publications
358 citations

Aarhus University
Aarhus, Denmark
4 h-index
5 publications
100 citations
1–8 of 121
11 publications · 499 citations
11
h-index
Repository · 10 publications · 242 citations
10
h-index
Repository · 6 publications · 107 citations
6
h-index
5 publications · 782 citations
5
h-index
5 publications · 279 citations
5
h-index
1–5