Computing mixed discriminants, mixed volumes, and permanents
From MaRDI portal
Publication:1364142
DOI10.1007/PL00009316zbMATH Open0876.68113MaRDI QIDQ1364142FDOQ1364142
Authors: Alexander Barvinok 
Publication date: 24 August 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- Mathematical Foundations of Computer Science 2005
- Stability and complexity of mixed discriminants
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Cited In (20)
- On linearized versions of matrix inequalities
- Classical complexity and quantum entanglement
- Approximating the permanent via importance sampling with application to the dimer covering problem
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- On The Complexity of Computing Mixed Volumes
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- Calculation of the permanent of a sparse positive matrix
- Measure concentration in optimization
- Mathematical Foundations of Computer Science 2005
- On the complexity of constrained determinantal point processes
- Random determinants, mixed volumes of ellipsoids, and zeros of Gaussian random fields
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor
- Computing mixed volume and all mixed cells in quermassintegral time
- Dimension results for extremal-generic polynomial systems over complete toric varieties
- Immanants and finite point processes
- Stability and complexity of mixed discriminants
- Relative entropy optimization and its applications
- An efficient tree decomposition method for permanents and mixed discriminants
- Short note on some geometric inequalities derived from matrix inequalities
This page was built for publication: Computing mixed discriminants, mixed volumes, and permanents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364142)
