The d-step conjecture and Gaussian elimination

Discrete and Computational Geometry

Volumn 18, Issue 1, 1997, Pages 53-82

  Lagarias, J C ^a   Prabhu, N ^b   Reeds, J A ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031489431     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009308     Document Type: Article

References (14)

1. D. Bailey, Multiprecision translation and execution of Fortran programs, ACM Trans. Math. Software 19 (1993), 288-319.
2. J. Day and B. Peterson, Growth in Gaussian elimination, Amer. Math. Monthly 95 (1988), 489-513.
3. B. Grunbaum, Convex Polytopes, Interscience, London, 1967.
4. G. Kalai, A subexponential randomized simplex algorithm, Proc. 24th ACM Symposium on Theory of Computing, ACM Press, New York, 1992, pp. 475-482.
5. G. Kalai and D. Kleitman, A quasi-polynomial bound for the diameter of graphs of polyhedra, Bull. Amer. Math. Soc. (N. S.) 26 (1992), 315-316.
6. V. Klee, How many steps? In Convexity and Related Combinatorial Geometry (Eds.: M. Breen and D. Kay), Marcel Dekker, New York, 1982, pp. 1-6.
7. V. Klee and P. Kleinschmidt, The d-step conjecture and its relatives, Math. Oper. Res. 12 (1987), 718-755.
8. V. Klee and D. Walkup, The d-step conjecture for polyhedra of dimension d < 6, Acta.Math. 113 (1967), 53-78.
9. D. G. Larman, Paths in polytopes, Proc. London Math. Soc. 20 (1970), 161-178.
10. v-path conjecture, Math. Oper. Res. 5 (1980), 595-598.
11. G. Strang, Linear Algebra and Its Applications, Academic Press, New York, 1976.
12. L. Trefethen and R. S. Schrieber, Average-case stability of Gaussian elimination, SIAM J. Matrix Anal. Appl. 11 (1990), 335-360.
13. Y. A. Yemelichev, M. M. Kovalev, and M. K. Kravtsov, Polytopes, Graphs and Optimization, Cambridge University Press, Cambridge, 1984.
14. G. M. Ziegler, Lectures on Polytopes, Springer-Verlag, New York, 1995.