Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity.
Alin BostanLouis DumontBruno SalvyPublished in: CoRR (2015)
Keyphrases
- worst case
- computational complexity
- upper and lower bounds
- computational cost
- orders of magnitude
- learning algorithm
- computationally complex
- space complexity
- error bounds
- high computational complexity
- optimization problems
- significant improvement
- data structure
- benchmark datasets
- database
- average case
- lower bound
- complexity measures
- computationally efficient
- memory requirements
- graph theory
- lower and upper bounds
- linear algebra
- lower complexity
- worst case bounds