Skip to content
cs-conference-ranking.org

A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions

Wolfgang J. Paul

VenueA*STOC
Year1975
ProceedingsSTOC
DBLP recordconf/stoc/Paul75 ↗

Browse the full STOC paper archive.