Algorithm for computing the truncation of the discriminant of a polynomial
From MaRDI portal
Publication:6043784
DOI10.1134/s0361768823010061zbMath1523.14083MaRDI QIDQ6043784
Evgeny Mikhalkin, A. P. Lyapin
Publication date: 24 May 2023
Published in: Programming and Computer Software (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Computational methods for problems pertaining to convex and discrete geometry (52-08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the analytic complexity of discriminants
- Blow-ups for the Horn-Kapranov parametrization of the classical discriminant
- On facets of the Newton polytope for the discriminant of the polynomial system
- Geometry of factorization identities for discriminants
- Tropical discriminants
- Hispanic Heritage Month
- Detailed Factorization Identities for Classical Discriminant
This page was built for publication: Algorithm for computing the truncation of the discriminant of a polynomial