Circuit Depth Complexity
Circuit Depth Complexity is the minimum depth, measured as the length of the longest path from an input node to an output node, among all Boolean circuits that compute a given function, where depth corresponds to the number of layers of logic gates in the circuit.
120
Publications
7.2K
Citations
249
Authors
124
Institutions
Publications per year
2017–2026
36
Variants
Circuit Depth
Parents
120
Almost optimal lower bounds for small depth circuits
Johan Håstad · 1986 · 630 citations
On Relating Time and Space to Size and Depth
Allan Borodin · SIAM Journal on Computing · 1977 · 341 citations
Differentiable learning of quantum circuit Born machines
Jin-Guo Liu, Lei Wang · Physical review. A/Physical review, A · 2018 · 282 citations · Full text
Computing, Computer Science, Physics +16
1–5 of 120
249
6
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 249
124

University of Toronto
Toronto, Canada
6 h-index
12 publications
1.4K citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
7 publications
1.7K citations
Stanford University
Stanford, United States
5 h-index
8 publications
613 citations

Weizmann Institute of Science
Rehovot, Israel
4 h-index
6 publications
335 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
6 publications
833 citations
University of Michigan
Ann Arbor, United States
4 h-index
5 publications
198 citations
University of California San Diego
San Diego, United States
4 h-index
8 publications
179 citations
TU Dortmund University
Dortmund, Germany
3 h-index
5 publications
137 citations
1–8 of 124
11 publications · 902 citations
10
h-index
Repository · 8 publications · 241 citations
8
h-index
PRL · 5 publications · 482 citations
5
h-index
4 publications · 137 citations
4
h-index
3 publications · 80 citations
3
h-index
1–5