Pages that link to "Item:Q1364142"
From MaRDI portal
The following pages link to Computing mixed discriminants, mixed volumes, and permanents (Q1364142):
Displaying 19 items.
- Relative entropy optimization and its applications (Q507310) (← links)
- Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386) (← links)
- Measure concentration in optimization (Q1365046) (← links)
- Immanants and finite point processes (Q1584658) (← links)
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary (Q1611062) (← links)
- Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
- Classical complexity and quantum entanglement (Q1886316) (← links)
- Random determinants, mixed volumes of ellipsoids, and zeros of Gaussian random fields (Q2253979) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- On The Complexity of Computing Mixed Volumes (Q4388877) (← links)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
- On the Complexity of Constrained Determinantal Point Processes (Q5002639) (← links)
- Stability and complexity of mixed discriminants (Q5207439) (← links)
- Short note on some geometric inequalities derived from matrix inequalities (Q6126584) (← links)
- On linearized versions of matrix inequalities (Q6173912) (← links)
- Dimension results for extremal-generic polynomial systems over complete toric varieties (Q6196136) (← links)
