Pages that link to "Item:Q1683740"
From MaRDI portal
The following pages link to Computing mixed volume and all mixed cells in quermassintegral time (Q1683740):
Displaying 9 items.
- Do most polynomials generate a prime ideal? (Q288524) (← links)
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- Euclidean distance degree and mixed volume (Q2098233) (← links)
- Unmixing the mixed volume computation (Q2421592) (← links)
- Pruning Algorithms for Pretropisms of Newton Polytopes (Q2830024) (← links)
- A polyhedral homotopy algorithm for real zeros (Q6047530) (← links)
- The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial Systems (Q6060347) (← links)
- Sparse trace tests (Q6133451) (← links)