Analysis of the binary complexity of asymptotically fast algorithms for linear system solving.
Brent GregoryErich KaltofenPublished in: SIGSAM Bull. (1988)
Keyphrases
- worst case
- computational complexity
- complexity analysis
- theoretical analysis
- space complexity
- statistical analysis
- combinatorial optimization
- times faster
- orders of magnitude
- learning algorithm
- resource constrained project scheduling problem
- computational cost
- data structure
- machine learning algorithms
- optimization problems
- significant improvement
- computationally efficient
- image analysis
- convex optimization problems
- sparse matrices