Login / Signup
Non-commutative computations: lower bounds and polynomial identity testing.
Guillaume Lagarde
Guillaume Malod
Sylvain Perifel
Published in:
Electron. Colloquium Comput. Complex. (2016)
Keyphrases
</>
lower bound
upper bound
objective function
branch and bound algorithm
branch and bound
np hard
test cases
optimal solution
vc dimension
worst case
database
upper and lower bounds
quadratic assignment problem
randomly generated problems
search algorithm
sample complexity
lower and upper bounds