Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
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
217
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
Mathematics
Circuit Complexity
100%
Boolean Functions
69%
Monotone
56%
Clique
46%
Lower bound
31%
Graph in graph theory
16%
Maximum Clique
15%
Rough
11%
Approximation
6%