Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
The monotone circuit complexity of boolean functions
Noga Alon
, Ravi B. Boppana
Research output
:
Contribution to journal
›
Article
›
peer-review
245
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The monotone circuit complexity of boolean functions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Monotone Circuits
100%
Monotone Complexity
100%
Boolean Function Complexity
100%
Superpolynomials
40%
Exponential Lower Bounds
20%
Boolean Functions
20%
Maximum Clique
20%
Rough Approximation
20%
Mathematics
Clique
100%
Boolean Function
100%
Exp
60%