Login / Signup
Non-commutative computations: lower bounds and polynomial identity testing.
Guillaume Lagarde
Guillaume Malod
Sylvain Perifel
Published in:
Chic. J. Theor. Comput. Sci. (2019)
Keyphrases
</>
lower bound
upper bound
branch and bound
branch and bound algorithm
objective function
lower and upper bounds
special case
np hard
worst case
neural network
test cases
upper and lower bounds
test set
average case complexity
optimal cost
constant factor
software testing
case study
learning algorithm
machine learning