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
Explicit lower bound of 4.5n - o(n) for Boolean circuits
O. Lachish,
R. Raz
Research output
:
Contribution to journal
›
Conference article
›
peer-review
41
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Explicit lower bound of 4.5n - o(n) for Boolean circuits'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Engineering & Materials Science
Boolean functions
100%
Networks (circuits)
44%
Polynomials
15%