On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time.
Simon KahanJack SnoeyinkPublished in: Comput. Geom. (1999)
Keyphrases
- worst case
- computational complexity
- computational cost
- space complexity
- data structure
- theoretical analysis
- data sets
- reduced complexity
- computer vision
- np hard
- upper bound
- np complete
- computationally complex
- high computational complexity
- orders of magnitude
- data mining techniques
- special case
- lower bound
- decision trees
- social networks
- learning algorithm