On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time.
Simon KahanJack SnoeyinkPublished in: SCG (1996)
Keyphrases
- worst case
- computational complexity
- optimization problems
- computational cost
- learning algorithm
- np complete
- computational issues
- np hard problems
- practical problems
- polynomial time complexity
- complexity bounds
- benchmark problems
- computationally hard
- high computational complexity
- space complexity
- data sets
- decision problems
- data structure
- orders of magnitude
- related problems
- problems in computer vision
- theoretical guarantees
- special case
- global minima
- social networks
- fixed parameter tractable
- run times
- search algorithm
- significant improvement
- linear space
- computational problems
- np hard
- data mining techniques
- complexity analysis
- theoretical analysis