A Laplace transform algorithm for the volume of a convex polytope.
We provide two algorithms for computing the volume of the convex polytope Ω : = {x ∈ ℝn+ | Ax ≤ b}, for A, ∈ ℝm×n, b ∈ ℝn. The computational complexity of both algorithms is essentially described by nm, which makes them especially attractive for large n and relatively small m, when the other methods...
| Pubblicato in: | Journal of the ACM 48, 6 (2001). |
|---|---|
| Autore principale: | |
| Natura: | Articolo |
| Lingua: | English |
| Soggetti: |