On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. III. Optimal Algorithms for the Computation of xy and xy where x, y in M2(K).
Hans F. de GrootePublished in: Theor. Comput. Sci. (1978)
Keyphrases
- worst case
- computational complexity
- dynamic programming
- recently developed
- computationally efficient
- times faster
- approximately optimal
- efficient algorithms for computing
- computational cost
- state space
- scheduling problem
- exact computation
- exhaustive search
- computationally expensive
- database
- np hard
- optimal solution
- neural network
- real time