Sampling and integration of near log-concave functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 156-163

  Applegate, David ^a   Kannan, Ravi ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV CHAINS; POLYNOMIAL APPROXIMATION; SET THEORY;

CONVEX BODY; FAST CONVERGENCE; ISOPERIMETRIC INEQUALITIES; LOG CONCAVES; POLYNOMIAL-TIME ALGORITHMS; RAPIDLY MIXING; SAMPLING ALGORITHM; SHARP CORNERS;

COMPUTATION THEORY;

EID: 85025262253     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103439     Document Type: Conference Paper

References (7)

1. BONNESEN, T., AND FENCHEL, W. Zheorie der konvezen Korper. Springer, Berlin, 1934.
2. DYER, M., FRIEZE, A., AND KANNAN, R. A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the Association for Computing Machinery (1989).To appear.
3. GROTSCHEL, M., Lovhz, L., AND SCHRIJVER, A. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988.
4. HOEFFDING, W. Probability y inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (1963), 13-30.
5. LENSTRA, H. W. Integer programming with a fixed number of variables. Mathematics of Operations Research 8, 4 (1983), 538-548.
6. Lov, lsz, L., AND SIMONOVITS, M. The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In Proceedings of the Thirty-First IEEE Symposium on Foundations of Computer Science (1990), pp. 346-355.
7. SCLAIR, A., AND JERRUM, M. Approximate counting, uniform generation and rapidly mixing markov chains. Information and Computation (1987).To appear.