An &Ohgr;(n2 log n) lower bound to the shortest paths problem

Authors:
Andrew C. Yao;David M. Avis;Ronald L. Rivest
Affiliations:
-;-;-
Venue:
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Year:
1977

Citing 4
Cited 1

Algorithm 97: Shortest path

Communications of the ACM
On computing the minima of quadratic forms (Preliminary Report)

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Applications of path compression on balanced trees.

Applications of path compression on balanced trees.
The effect of algebraic structure on the computational complexity of matrix multiplication

The effect of algebraic structure on the computational complexity of matrix multiplication

Information Bounds Are Weak in the Shortest Distance Problem

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let P be a polyhedron with fs s-dimensional faces. We show that &Ohgr;(log fs) linear comparisons are needed to determine if a point lies in P. This is used to establish an &Ohgr;(n2 log n) lower bound to the all-pairs shortest path problem between n points.