Login / Signup
Stronger Lower Bounds for Polynomial Time Problems.
András Z. Salamon
Michael Wehar
Published in:
CoRR (2020)
Keyphrases
</>
lower bound
special case
randomly generated problems
min sum
worst case
objective function
upper bound
linear programming
np complete
np hardness