scientific article; zbMATH DE number 431987
From MaRDI portal
Publication:3138745
zbMATH Open0789.52016MaRDI QIDQ3138745FDOQ3138745
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Parallel algorithms in computer science (68W10)
Cited In (21)
- On the Complexity of Computing the Volume of a Polyhedron
- The Santalo point of a planar convex set
- On The Complexity of Computing Mixed Volumes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Easy and optimal queries to reduce set uncertainty
- Counting linear extensions
- Optimal oversampling ratio in two-step simulation
- Title not available (Why is that?)
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space
- Different Volume Computation Methods of Graph Polytopes
- The best ways to slice a polytope
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- How to integrate a polynomial over a simplex
- Performance metric and analytical gain optimality for set-based robust fault detection
- Decoupling and Partial Independence
- Ehrhart polynomials of matroid polytopes and polymatroids
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Title not available (Why is that?)
- Scientific contributions of Leo Khachiyan (a short overview)
- Polytope Volume Computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138745)
