The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 12, 346-354
- https://doi.org/10.1109/fscs.1990.89553
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Eigenvalues, Expanders And SuperconcentratorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A random polynomial time algorithm for approximating the volume of convex bodiesPublished by Association for Computing Machinery (ACM) ,1989
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- A geometric inequality and the complexity of computing volumeDiscrete & Computational Geometry, 1986
- Eigenvalues and expandersCombinatorica, 1986
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Theorie der Konvexen KörperPublished by Springer Nature ,1934