SIGN IN
SIGN UP
A random polynomial-time algorithm for approximating the volume of convex bodies
Full Text:
PDF
Buy this Article
Authors:
Martin Dyer
Univ. of Leeds, UK
Alan Frieze
Carnegie-Mellon Univ., Pittsburgh, PA
Ravi Kannan
Carnegie-Mellon Univ., Pittsburgh, PA
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 38 Issue 1, Jan. 1991
Pages 1-17
ACM
New York, NY
, USA
table of contents
doi>
10.1145/102782.102783
1991 Article
Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 107
· Downloads (cumulative): 1,130
· Citation Count: 74
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
convex sets
geometrical problems and computations
probabilistic algorithms
random walks
sampling
theory
volume
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder