Pages that link to "Item:Q4388877"
From MaRDI portal
The following pages link to On The Complexity of Computing Mixed Volumes (Q4388877):
Displayed 12 items.
- 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)
- 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)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- (Deterministic) algorithms that compute the volume of polytopes (Q4360038) (← links)
- A Polyhedral Method for Solving Sparse Polynomial Systems (Q4878511) (← links)
- A systematic framework for solving geometric constraints analytically (Q5926297) (← links)