Computing mixed discriminants, mixed volumes, and permanents
From MaRDI portal
Publication:1364142
DOI10.1007/PL00009316zbMath0876.68113MaRDI QIDQ1364142
Publication date: 24 August 1997
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
Classical complexity and quantum entanglement, Measure concentration in optimization, On the Complexity of Constrained Determinantal Point Processes, Computing mixed volume and all mixed cells in quermassintegral time, Short note on some geometric inequalities derived from matrix inequalities, On linearized versions of matrix inequalities, Dimension results for extremal-generic polynomial systems over complete toric varieties, An efficient tree decomposition method for permanents and mixed discriminants, Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor, Relative entropy optimization and its applications, Random determinants, mixed volumes of ellipsoids, and zeros of Gaussian random fields, Calculation of the permanent of a sparse positive matrix, A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor, Approximating the permanent via importance sampling with application to the dimer covering problem, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, Immanants and finite point processes
