Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets.

Lane A. Hemachandra

Published in: SIGAL International Symposium on Algorithms (1990)

Keyphrases

shortest path
complexity theory
computationally expensive
computational geometry
learning algorithm
object recognition
computationally efficient
complex systems
path planning
computationally intensive
decision trees
multiscale
distance function