A quasi-optimal lower bound for skew polynomial multiplication.
Qiyuan ChenKe YePublished in: ISSAC (2024)
Keyphrases
- lower bound
- optimal solution
- upper bound
- worst case
- optimal cost
- competitive ratio
- dynamic programming
- branch and bound algorithm
- constant factor
- np hard
- branch and bound
- exhaustive search
- learning algorithm
- closed form
- floating point
- lower and upper bounds
- upper and lower bounds
- objective function
- similarity measure
- knapsack problem
- lower bounding
- data structure
- arithmetic operations