Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference14 articles.
1. I. Bárány, Z. Füredi, Computing the volume is difficult,Discrete Comput. Geom.,2(4) (1987), 319–326.
2. A. I. Barvinok, Calculation of exponential integrals (in Russian),Zap. Nauchn. Sem. LOMI, Teoriya Slozhnosti Vychislenii,192(5) (1991), 149–163.
3. M. Brion, Points entiers dans les polyèdres convexes,Ann. Sci. Ècole Norm. Sup (4),21(4) (1988), 653–663.
4. M. Dyer, A. M. Frieze. On the complexity of computing the volume of a polyhedron,SIAM J. Comput.,17(5) (1988), 967–974.
5. M. Dyer, A. M. Frieze, R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies,J. Assoc. Comput. Mach.,38(1) (1991), 1–17.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Equivariant localization and holography;Letters in Mathematical Physics;2024-01-08
2. Algebraic Perspectives on Signomial Optimization;SIAM Journal on Applied Algebra and Geometry;2022-12-16
3. Polyhedral Circuits and Their Applications;Algorithmic Aspects in Information and Management;2020
4. Geometry of Log-Concave Density Estimation;Discrete & Computational Geometry;2018-08-24
5. Statistical properties of the single linkage hierarchical clustering estimator;Journal of Statistical Planning and Inference;2017-06