Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds.

Valentine Kabanets Russell Impagliazzo

Published in: Comput. Complex. (2004)

Keyphrases

lower bound
upper bound
branch and bound algorithm
objective function
branch and bound
np hard
lower and upper bounds
optimal solution
high speed
inductive inference
low order
quadratic assignment problem
lower bounding
analog circuits