Login / Signup
Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT.
Pranjal Dutta
Nitin Saxena
Thomas Thierauf
Published in:
Electron. Colloquium Comput. Complex. (2020)
Keyphrases
</>
lower bound
objective function
upper bound
np hard
branch and bound algorithm
min sum
genetic algorithm
optimal solution
lower and upper bounds
special case
constraint satisfaction problems
branch and bound
lower bounding
polynomial approximation