Computational Complexity of Inner Products of Vectors (And That of Other Bilinear Forms) over a Noncommutative Ring (Auxiliary Functions Allowed).
Robert MandlThomas VariPublished in: SIAM J. Comput. (1975)
Keyphrases
- artificial intelligence
- computational complexity
- np complete
- low complexity
- rate distortion
- principal components
- memory requirements
- feature vectors
- real time
- vector space
- basis functions
- motion estimation
- computational cost
- computationally efficient
- np hard
- website
- singular value decomposition
- learning algorithm
- genetic algorithm
- database
- storage requirements
- algebraic structure