A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Greg BarnesJonathan F. BussWalter L. RuzzoBaruch SchieberPublished in: Computational Complexity Conference (1992)
Keyphrases
- computational complexity
- search space
- dynamic programming
- learning algorithm
- higher dimensional
- preprocessing
- k means
- cost function
- computational cost
- times faster
- detection algorithm
- worst case
- np hard
- special case
- significant improvement
- segmentation algorithm
- improved algorithm
- optimal solution
- optimization algorithm
- theoretical analysis
- expectation maximization
- linear programming
- neural network
- experimental evaluation
- low dimensional
- probabilistic model
- multi objective
- evolutionary algorithm
- matching algorithm
- mobile robot
- convergence rate
- objective function
- space requirements
- approximation ratio
- alphabet size