Login / Signup
One More Method For Proving Lower Bounds on the Formula Complexity of Boolean Functions.
Vladimir Stetsenko
Published in:
MFCS (1989)
Keyphrases
</>
boolean functions
lower bound
computational complexity
objective function
worst case