Pages that link to "Item:Q4388877"
From MaRDI portal
The following pages link to On The Complexity of Computing Mixed Volumes (Q4388877):
Displayed 29 items.
- A practical volume algorithm (Q298158) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- On the reverse Loomis-Whitney inequality (Q724946) (← 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)
- How to count efficiently all affine roots of a polynomial system (Q1289017) (← links)
- Toric intersection theory for affine root counting (Q1295703) (← links)
- The Blaschke-Steinhardt point of a planar convex set (Q1339815) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Efficiently counting affine roots of mixed trigonometric polynomial systems (Q1697755) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Combinatorial mixed valuations (Q2404648) (← links)
- Unmixing the mixed volume computation (Q2421592) (← links)
- Computing tropical resultants (Q2438901) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Volume of convex polytopes equals mixed volume of simplices (Q2694010) (← links)
- An Implementation of Exact Mixed Volume Computation (Q2819217) (← links)
- Heat flow and a faster algorithm to compute the surface area of a convex body (Q2868081) (← links)
- Stochastic Billiards for Sampling from the Boundary of a Convex Set (Q3465938) (← links)
- (Deterministic) algorithms that compute the volume of polytopes (Q4360038) (← links)
- A Polyhedral Method for Solving Sparse Polynomial Systems (Q4878511) (← links)
- Extensions of the Kahn-Saks inequality for posets of width two (Q5886260) (← links)
- A systematic framework for solving geometric constraints analytically (Q5926297) (← links)
- The convex hull of parking functions of length n (Q6098015) (← links)