Martin Dyer, Alan Frieze  Home/Search
Context Related
| cmu.edu/~af1p/volume.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~af1p/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We discuss the problem of computing the volume of a convex body K in IR n . We review worst-case results which show that it is hard to deterministically approximate volnK and randomised approximation algorithms which show that with randomisation one can approximate very nicely. We then provide some applications of this latter result. Supported by NATO grant RG0088/89 y Supported by NSF grant CCR-8900112 and NATO grant RG0088/89 1 Introduction The mathematical study of areas and... (Update)
Cited by: More
The Risk Profile Problem for Stock Portfolio Optimization - Ming-Yang Kao Andreas (Correct)
CS294-2 Markov Chain Monte Carlo: Foundations.. - Lecture October Lecturer (Correct)
Faster Mixing for Conductance Methods - Montenegro (Correct)
Active bibliography (related documents): More All
0.6: A Random Polynomial Time Algorithm For Approximating The.. - Dyer, Frieze, Kannan (1995) (Correct)
0.6: Volume Estimates and Rapid Mixing - Bollobas (1997) (Correct)
0.5: The Markov Chain Monte Carlo Method: An Approach To.. - Jerrum, Sinclair (1996) (Correct)
Similar documents based on text: More All
0.1: The Average Performance Of The Greedy Matching Algorithm - Dyer, Frieze, Pittel (1997) (Correct)
0.1: Random Walks And An O*(n 5 ) Volume Algorithm For.. - Kannan, Lovász, .. (1996) (Correct)
0.1: Maximum matchings in sparse random graphs: Karp-Sipser.. - Aronson, Frieze, Pittel (1997) (Correct)
Related documents from co-citation: More All
17: A random polynomial time algorithm for approximating the volume of a convex body - Dyer, Frieze et al. - 1991
8: the conductance of order markov chains (context) - Karzanov, Kachiyan - 1991
8: Sampling and integration of near log-concave functions (context) - Applegate, Kannan - 1991
BibTeX entry: (Update)
Dyer, M. and Frieze, A. Computing the volume of convex bodies: a case where randomness provably helps. Probabilistic Combinatorics and its Applications, Proceedings of AMS Symposia in Applied Mathematics Volume 44 (1994) pp. 123-170. http://citeseer.ist.psu.edu/dyer91computing.html More
@inproceedings{ dyer91computing,
author = "Dyer and Frieze",
title = "Computing the Volume of Convex Bodies: {A} Case Where Randomness Provably Helps",
booktitle = "{PSAM}: Proceedings of the 44th Symposium in Applied Mathematics, American Mathematical Society",
year = "1991",
url = "citeseer.ist.psu.edu/dyer91computing.html" }
Citations (may not include all citations):640 Princeton University Press (context) - Rockafellar, analysis - 1970
411 Random Graphs (context) - Bollob'as - 1985
375 Probability inequalities for sums of bounded random variable.. (context) - Hoeffding - 1963
333 Geometric algorithms and combinatorial optimization (context) - Grotschel, Lov'asz et al. - 1988
145 Random generation of combinatorial structures from a uniform.. (context) - Jerrum, Valiant et al. - 1986
115 Approximating the permanent (context) - Jerrum, Sinclair - 1989
100 Integer programming with a fixed number of variables (context) - Lenstra - 1983
98 A random polynomial time algorithm for approximating the vol.. - Dyer, Frieze et al. - 1989
68 Pseudorandom generators for space-bounded computation (context) - Nisan - 1990
58 Monte-Carlo algorithms for enumeration and reliability probl.. (context) - Karp, Luby - 1983
34 What is mathematics (context) - Courant, Robbins - 1941
33 the complexity of computing the volume of a polyhedron (context) - Dyer, Frieze - 1988
30 Geometric inequalities (context) - Burago, Zalgaller - 1988
25 Sampling and integration of near log-concave functions (context) - Applegate, Kannan - 1990
23 the conductance of order Markov chains (context) - Karzanov, Khachiyan - 1990
14 Hard enumeration problems in geometry and combinatorics (context) - Linial - 1986
14 A geometric inequality and the complexity of computing volum.. (context) - Elekes - 1986
13 Counting linear extensions is #P-complete (context) - Brightwell, Winkler - 1990
9 Introduction to the theory of probability and its applicatio.. (context) - Feller - 1968
8 American Mathematical Monthly (context) - Aldous, Diaconis et al. - 1986
6 the complexity of computing the volume of a polytope (context) - Khachiyan - 1988
5 Generating a random linear extension of a partial order (context) - Matthews - 1989
4 th Annual ACM Symposium on Theory of Computing (context) - B'ar'any, Furedi et al. - 1986
3 An optimal Poincar'e inequality for convex domains (context) - Payne, Weinberger - 1960
2 Sur une in'egalit'e isop'erim'etrique qui g'eneralise celle .. (context) - B'erard, Besson et al. - 1985
1 Center for Computing and Applied Mathematics (context) - Lawrence, computation et al. - 1989
1 Mathematical Institute of the Hungarian Academy of Sciences (context) - Lov'asz, Simonovits et al. - 1990
1 generation and rapidly mixing Markov chains (context) - Sinclair, Jerrum et al. - 1989
1 Every poset has a good comparison (context) - Kahn, Saks - 1984
1 On the complexity of learning from counterexamples, Proc. 30.. (context) - Maass, Tur'an - 1989
1 Duke Math (context) - Stone, Tukey et al. - 1942
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.cmu.edu/~af1p/papers.html): More
Quick Approximation to Matrices and Applications - Frieze, Kannan (1999) (Correct)
Analysis Of Two Simple Heuristics On A Random Instance Of k-SAT - Frieze, Suen (1996) (Correct)
When is the Assignment Bound Tight for the Asymmetric.. - Frieze, Karp, Reed (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC