Skip to main content
SpringerLink
Log in

Complexity of Polytope Volume Computation

  • Chapter
New Trends in Discrete and Computational Geometry

Part of the book series: Algorithms and Combinatorics ((AC,volume 10))

Abstract

We survey some recent results on the complexity of computing the vol­ume of convex n-dimensional polytopes.

On leave from Computing Center of the USSR Academy of Sciences

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Barany and Z. Furedi: Computing the volume is difficult. Proc. 18th Sympo­sium on Theory of Computing, 1986, pp. 442–447

    Google Scholar 

  2. G. Brightwell and P. Winkler: Counting linear extensions is #P-complete. Preprint, Bellcore, July 1990

    Google Scholar 

  3. M. Dyer and A. Frieze: On the complexity of computing the volume of polyhe­dron. SIAM J. Computing 17 (1988) 967–974

    MathSciNet  MATH  Google Scholar 

  4. M. Dyer, A. Frieze and R. Kannan: A random polynomial time algorithm for estimating volumes of convex bodies. Proc. 21st Symposium on Theory of Com­puting, 1989, pp. 375–381

    Google Scholar 

  5. G. Elekes: A geometric inequality and the complexity of computing volume. Discrete and Computational Geometry, 1 (1986) 289–292

    Article  MathSciNet  MATH  Google Scholar 

  6. M. Fredman: How good is the information theory bound in sorting. Theoretical Computer Science, 1 (1976) 355–361

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Gritzmann: Private communication

    Google Scholar 

  8. M. Grötschel, L. Lovasz, and A. Schrijver: Geometric Algorithms and Combi­natorial Optimization. Springer, 1988

    Google Scholar 

  9. F. John: Extremum problems with inequalities as subsidiary conditions. Studies and essays presented to R. Courant on his 60th birthday. Interscience Publ., New York 1948, pp. 187–204

    Google Scholar 

  10. J. Kahn and M. Saks: Every poset has a good comparison. Proc. 16th Sympo­sium on Theory of Computing, 1984, pp. 299–301

    Google Scholar 

  11. A. Karzanov and L. Khachiyan: On the conductance of order Markov chains. Technical Report DCS TR 268, Rutgers University, June 1990

    Google Scholar 

  12. L. Khachiyan: On the complexity of computing the volume of a polytope. Izves­tia Akad. Nauk SSSR, Engineering Cybernetics 3 (1988) 216–217 (in Russian)

    Google Scholar 

  13. L. Khachiyan: The problem of computing the volume of polytopes is #P-hard. Uspekhi Mat. Nauk 44, no. 3 (1989) 199–200

    MathSciNet  MATH  Google Scholar 

  14. M. Kozlov: Algorithms for volume computation, based on Laplace Transform. Preprint, Computing Center of the USSR Academy of Sciences, 1986

    Google Scholar 

  15. J. Lawrence: Polytope volume computation. Preprint NISTIR 89–4123, U.S. De­partment of Commerce, National Institute of Standards and Technology, Center for Computing and Applied Mathematics, Gaithersburg, October 1989

    Google Scholar 

  16. K. Leichtweis: Convex sets. Springer, 1980

    Google Scholar 

  17. N. Linial: Hard enumeration problems in geometry and combinatorics. SIAM J. on Algebraic and Discrete Methods 7, no.2 (1986) 331–335

    Article  MathSciNet  MATH  Google Scholar 

  18. L. Lovasz: Algorithmic aspects of combinatorics, geometry and number theory. Proc. Internat. Congress Math. Warsaw 1983, Vol. 1, Warsaw 1984, pp. 1591–1599

    MathSciNet  Google Scholar 

  19. L. Lovasz and M. Simonovits: The mixing rate of Markov chains, an isoperi­metric inequality, and computing the volume. Preprint 27/1990, Mathematical Institute of the Hungarian Academy of Sciences, May 1990

    Google Scholar 

  20. L. Lovasz and M. Simonovits: Random walks in a convex body and an improved volume algorithm. Preprint, Preliminary version, December 1991

    Google Scholar 

  21. A. Sinclair and M. Jerrum: Approximate counting, generation and rapidly mix­ing Markov chains. Information and Computation 82 (1989) 93–133

    Article  MathSciNet  MATH  Google Scholar 

  22. R. Stanley: Two order polytopes. Discrete and Computational Geometry 1 (1986) 9–23

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Leonid Khachiyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, H-1364, Budapest, PF-127, Hungary

    János Pach

  2. Courant Institute, New York University, 251 Mercer Street, New York, NY, 10012, USA

    János Pach

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Khachiyan, L. (1993). Complexity of Polytope Volume Computation. In: Pach, J. (eds) New Trends in Discrete and Computational Geometry. Algorithms and Combinatorics, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58043-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58043-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55713-5

  • Online ISBN: 978-3-642-58043-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation