A Lower Bound for the Shortest Path Problem

Journal of Computer and System Sciences

Volumn 63, Issue 2, 2001, Pages 253-267

  Mulmuley, Ketan ^a,b   Shah, Pradyut ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041078927     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1766     Document Type: Article

References (22)

1. Ben-Or M. Lower bounds for algebraic computation tress. 15th ACM Symposium on the Theory of Computing. 1983;. p. 80-86.
2. M. Ben-Or, E. Feig, D. Kozen, and P. Tiwari, A fast parallel algorithm for determining all roots of a polynomial with real roots, in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, Berkeley, California, 28-30 May 1986, pp. 340-349.
3. Carstensen P. Complexity of some parametric integer and network programming problems. Math. Programming. 26:1983;64-75.
4. Carstensen P. The Complexity of Some Problems in Parametric Linear and Combinatorial Programming. 1983;Univ. of Michigan.
5. Carstensen P. Parametric cost shortest chain problem. ORSA/TIMS. 1987.
6. Csanky L. Fast parallel matrix inversion algorithms. SIAM J. Comput. 5:1976;618-623.
7. Frank A., Tardos É. An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica. 7:1987;49-65.
8. Garey M. R., Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
9. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, Berkeley, California, 28-30 May 1986, pp. 136-146.
10. Greenlaw R., Hoover H. J., Ruzzo W. L. Limits to Parallel Computation: P-Completeness Theory. 1995;Oxford Univ. Press, Oxford.
11. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1988;Springer-Verlag, Berlin.
12. J. Håstad, Almost optimal lower bounds for small depth circuits, in Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, Berkeley, California, 28-30 May 1986, pp. 6-20.
13. Karger D., Motwani R. An NC algorithm for minimum cuts. SIAM J. Comput. 26:1997.
14. Leighton F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. 1992;Morgan Kaufmann, San Mateo.
15. Lovász L., Plummer M. D. Matching theory. Annals of Discrete Mathematics. 1986;North-Holland Math. Studies, Amsterdam.
16. Mulmuley K. Lower bounds in a parallel model without bit operations. SIAM J. Comput. 28:1998.
17. Mulmuley K., Vazirani U. V., Vazirani V. V. matching is a easy as matrix inversion. Combinatorica. 7:1987;105-113.
18. Neff C. A. Specified precision polynomial root isolation is in NC. J. Comput. System Sci. 48:1994;429-463.
19. Razborov A. Lower bounds on the complexity of some boolean functions. Dokl. Ak. Nauk. 1985.
20. Reif J. H. Synthesis of Parallel Algorithms. 1993;Morgan Kaufmann, San Mateo.
21. 2 log n) parallel MAX-FLOW algorithm. J. Algorithms. 3:1982;128-146.
22. Yao A. Lower bounds for algebraic computation trees with integer inputs. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. 1977;. p. 222-227.