Upper and lower bounds for the average-case complexity of path-search.
Nicholas PippengerPublished in: Networks (1999)
Keyphrases
- upper and lower bounds
- upper bound
- lower bound
- search algorithm
- lower and upper bounds
- search space
- path finding
- average case
- small number
- search strategies
- shortest path
- dnf formulas
- search problems
- sample complexity
- search methods
- learning algorithm
- theoretical analysis
- support vector machine
- high dimensional
- decision trees