Circuit Size Complexity
Circuit Size Complexity is the minimum number of gates required in a Boolean circuit to compute a given Boolean function, serving as a measure of computational resource bounds within circuit complexity theory.
279
Publications
13.7K
Citations
503
Authors
243
Institutions
Publications per year
2017–2026
32
Parents
279
On Relating Time and Space to Size and Depth
Allan Borodin · SIAM Journal on Computing · 1977 · 341 citations
Scott Ames, Carmit Hazay, Yuval Ishai et al. · 2017 · 289 citations · Full text
1–5 of 279
503
7
h-index
6
h-index
6
h-index
6
h-index
Czech Academy of Sciences, Institute of Mathematics, Czechia
5 publications · 232 citations
5
h-index
1–5 of 503
243
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
12 publications
338 citations
TU Dortmund University
Dortmund, Germany
9 h-index
15 publications
532 citations
University of Michigan
Ann Arbor, United States
9 h-index
20 publications
1.1K citations
Motorola (United States)
Schaumburg, United States
8 h-index
8 publications
446 citations
Princeton University
Princeton, United States
7 h-index
9 publications
1.1K citations
University of Arizona
Tucson, United States
7 h-index
7 publications
278 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
7 h-index
11 publications
282 citations

KTH Royal Institute of Technology
Stockholm, Sweden
7 h-index
14 publications
717 citations
1–8 of 243
17 publications · 1.4K citations
16
h-index
16 publications · 1.2K citations
14
h-index
14 publications · 837 citations
13
h-index
11 publications · 424 citations
11
h-index
7 publications · 179 citations
7
h-index
1–5