A Laplace transform algorithm for the volume of a convex polytope

No abstract is available for this paper.

• Publication year

  2001

• Venue

  JACM

• Publication date

  2001-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/504794.504796
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Exact volume computation for polytopes: a practical study

  1996cited by this paper
• Convex analysis and minimization algorithms

  1993cited by this paper
• Multidimensional integral transformations

  1992cited by this paper
• Computing the volume, counting integral points, and exponential sums

  1992cited by this paper
• Polytope volume computation

  1991cited by this paper
• On the Complexity of Computing the Volume of a Polyhedron

  1988cited by this paper
• Theory of linear and integer programming

  1986cited by this paper
• The Complexity of Vertex Enumeration Methods

  1983cited by this paper
• An analytical expression and an algorithm for the volume of a convex polyhedron inRn

  1983cited by this paper
• Finding simplicial subdivisions of polytopes

  1981cited by this paper
• Two Algorithms for Determining Volumes of Convex Polyhedra

  1979cited by this paper

• A Laplace Duality for Integration

  2025cites this paper
• Convex Geometry

  2023cites this paper
• Computing Optimized Path Integrals for Knapsack Feasibility

  2022cites this paper
• Simple formula for integration of polynomials on a simplex

  2019cites this paper
• Positivity Certificates via Integral Representations

  2019cites this paper
• Astochastic interpretationof set-membershipfiltering : application to polynomial systems throughpolytopic bounding ⋆

  2018cites this paper
• N A ] 1 6 O ct 2 01 0 Multivariate Splines and Polytopes ∗

  2018cites this paper
• A Neural Architecture for Bayesian Compressive Sensing Over the Simplex via Laplace Techniques

  2018cites this paper
• Optimal deep neural networks for sparse recovery via Laplace techniques

  2017cites this paper
• Accelerating Performance Inference over Closed Systems by Asymptotic Methods

  2017cites this paper
• Accelerating Performance Inference over Closed Systems by Asymptotic Methods

  2017cites this paper
• Robust model predictive control

  2017cites this paper
• Airport games: The core and its center

  2016cites this paper
• Exploring stochasticity and imprecise knowledge based on linear inequality constraints

  2016cites this paper
• Statistical Properties of the Single Linkage Hierarchical Clustering Estimator

  2015cites this paper
• A probabilistic interpretation of set-membership filtering: Application to polynomial systems through polytopic bounding

  2015cites this paper
• A stochastic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding

  2015cites this paper
• Astochasticinterpretationofset-membershipfiltering: applicationtopolynomialsystemsthroughpolytopic bounding ⋆

  2015cites this paper
• Statistical estimation for Single Linkage Hierarchical Clustering

  2015cites this paper
• Maximum Likelihood Estimation for Single Linkage Hierarchical Clustering

  2015cites this paper
• Synthesising optimal timing delays for Timed I/O Automata

  2014cites this paper
• Quantitative verification of real-time properties with application to medical devices

  2014cites this paper
• Verification of linear duration properties over continuous-time markov chains

  2013influential citation
• Verification of Linear Duration Properties over Continuous Time

  2013cites this paper
• Imperial College Computing Student Workshop

  2012cites this paper
• Polytopic outer approximations of semialgebraic sets

  2012cites this paper
• Verification of linear duration properties over continuous-time markov chains

  2012cites this paper
• Mean value and volume-based sensitivity analysis for Olympic rankings

  2012cites this paper
• Time-Bounded Verification of CTMCs against Real-Time Specifications

  2011cites this paper
• APPROXIMATE AND FOR BASIC SEMI-ALGEBRAIC SETS

  2011cites this paper
• An objective-free outlying point detection model in data envelopment analysis

  2010cites this paper
• A Super-Resolution Framework for 3-D High-Resolution and High-Contrast Imaging Using 2-D Multislice MRI

  2009cites this paper
• Natural Neighbor Interpolation - Critical Assessment and New Contributions (Interpolation mit Natürlichen Nachbarn - Kritische Betrachtungen und Neue Erkenntnisse)

  2009cites this paper
• A multi-stack framework in magnetic resonance imaging

  2009cites this paper
• Approximate Volume and Integration for

  2009cites this paper
• A QUASI‐NATURAL MEASURE OF CHOICE FREEDOM FOR BUDGET‐ AND TIME‐CONSTRAINED OPPORTUNITY SETS

  2009cites this paper
• Ju l 2 00 8 Multivariate Splines and Polytopes

  2009cites this paper
• Duality and a Farkas lemma for integer programs

  2009cites this paper
• Multivariate splines and polytopes

  2008cites this paper
• Approximate Volume and Integration for Basic Semialgebraic Sets

  2008cites this paper
• Merging multiple stacks MRI into a single data volume

  2006cites this paper
• Interactive visualization and collision detection using dynamic simplification and cache-coherent layouts

  2005cites this paper
• Workshop on Massive Geometric Data Sets ( Massive 2005 )

  2005cites this paper
• Cache-oblivious mesh layouts

  2005cites this paper
• Cost-based labeling of groups of mass spectra

  2004cites this paper
• Convex Optimization & Euclidean Distance Geometry

  2004cites this paper
• Two-Step Shortlisting by Imperfect Experts

  2003cites this paper
• On Counting Integral Points in a Convex Rational Polytope

  2003cites this paper
• A Discrete Farkas Lemma

  2003cites this paper
• DUALITY AND A FARKAS LEMMA FOR INTEGER PROGRAMS

  2003cites this paper
• Solving the knapsack problem via Z-transform

  2002cites this paper
• Syllabus

  1959cites this paper