scientific article
From MaRDI portal
Publication:3138745
zbMath0789.52016MaRDI QIDQ3138745
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space ⋮ Counting linear extensions ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Easy and optimal queries to reduce set uncertainty ⋮ The Santalo point of a planar convex set ⋮ How to integrate a polynomial over a simplex ⋮ Ehrhart polynomials of matroid polytopes and polymatroids ⋮ An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
