Circuit Upper Bounds
Circuit Upper Bounds is a theoretical result in computational complexity theory that establishes an upper limit on the size or depth of Boolean circuits required to compute a given function or language within a specified complexity class.
376
Publications
21.1K
Citations
558
Authors
279
Institutions
Publications per year
2017–2026
44
Parents
376
Boosting a Weak Learning Algorithm by Majority
Yoav Freund · Information and Computation · 1995 · 1.7K citations
Almost optimal lower bounds for small depth circuits
Johan Håstad · 1986 · 630 citations
Some connections between nonuniform and uniform complexity classes
Richard M. Karp, Richard J. Lipton · 1980 · 582 citations · Full text
Separating the polynomial-time hierarchy by oracles
Andrew Chi-Chih Yao · 1985 · 554 citations
1–5 of 376
558
13
h-index
10
h-index
10
h-index
7
h-index
6
h-index
1–5 of 558
279
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
20 publications
856 citations
Stanford University
Stanford, United States
13 h-index
16 publications
1.1K citations
The University of Texas at Austin
Austin, United States
11 h-index
14 publications
435 citations
University of California San Diego
San Diego, United States
11 h-index
17 publications
647 citations
Princeton University
Princeton, United States
11 h-index
15 publications
595 citations

Weizmann Institute of Science
Rehovot, Israel
9 h-index
15 publications
637 citations
University of California, Los Angeles
Los Angeles, United States
9 h-index
17 publications
604 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
9 h-index
11 publications
473 citations
1–8 of 279
28 publications · 1.4K citations
22
h-index
12 publications · 395 citations
12
h-index
10 publications · 580 citations
10
h-index
Repository · 11 publications · 214 citations
10
h-index
Repository · 11 publications · 239 citations
10
h-index
1–5