On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey.
Joos HeintzPublished in: AAECC (1987)
Keyphrases
- computational complexity
- np complete
- high computational complexity
- low complexity
- special case
- decision problems
- computational cost
- np hard
- computationally efficient
- motion vectors
- computational efficiency
- multiscale
- algebraic geometry
- memory requirements
- free form
- schema mappings
- database
- singular value decomposition
- motion estimation
- data model
- evolutionary algorithm
- real time