Explicit lower bound of 4.5n - o(n) for Boolean circuits

O. Lachish, R. Raz

Research output: Contribution to journalConference articlepeer-review

43 Scopus citations

Fingerprint

Dive into the research topics of 'Explicit lower bound of 4.5n - o(n) for Boolean circuits'. Together they form a unique fingerprint.

Engineering & Materials Science