Boolean Function Complexity
Boolean Function Complexity is a theoretical framework in computational complexity theory that characterizes the minimum number of basic logical operations required to compute a given boolean function, thereby distinguishing it by the inherent resource demands of boolean computation tasks.
438
Publications
30.6K
Citations
643
Authors
334
Institutions
Publications per year
2017–2026
42
Parents
438
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve et al. · Journal of the ACM · 2001 · 659 citations
Computational limitations on learning from examples
Leonard Pitt, Leslie G. Valiant · Journal of the ACM · 1988 · 532 citations · Full text
1–5 of 438
643
12
h-index
10
h-index
10
h-index
9
h-index
8
h-index
1–5 of 643
334
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
24 publications
1.9K citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
13 h-index
18 publications
2.2K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
19 publications
759 citations
Columbia University
New York, United States
12 h-index
26 publications
1.2K citations
TU Dortmund University
Dortmund, Germany
12 h-index
26 publications
2.2K citations
University of California, Berkeley
Berkeley, United States
12 h-index
14 publications
546 citations
University of California San Diego
San Diego, United States
10 h-index
15 publications
809 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
10 h-index
14 publications
949 citations
1–8 of 334
38 publications · 2K citations
26
h-index
18 publications · 10.9K citations
18
h-index
15 publications · 786 citations
14
h-index
12 publications · 598 citations
11
h-index
Repository · 10 publications · 175 citations
10
h-index
1–5