A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields.
Michael KaminskiPublished in: STACS (2005)
Keyphrases
- lower bound
- average case complexity
- worst case
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- objective function
- optimal solution
- vapnik chervonenkis dimension
- complexity analysis
- lower and upper bounds
- decision problems
- polynomial hierarchy
- average case
- upper and lower bounds
- computational complexity
- computer vision
- finite number
- artificial intelligence
- markov random field
- arithmetic operations
- computational cost