Login / Signup
Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds?
Eric Allender
Published in:
CATS (2008)
Keyphrases
</>
lower bound
np hard
upper bound
computational complexity
high speed
branch and bound
np complete
branch and bound algorithm
lower and upper bounds
upper and lower bounds
real time
scheduling problem
maximum number
running times
lower bounding
constant factor