Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
Publication:1661547
DOI10.1007/S10958-018-3868-ZzbMath1405.13050OpenAlexW2803229928WikidataQ129753375 ScholiaQ129753375MaRDI QIDQ1661547
Publication date: 16 August 2018
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-018-3868-z
History of mathematics in the 20th century (01A60) History of mathematics in the 21st century (01A61) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Solving polynomial systems; resultants (13P15) History of commutative algebra (13-03)
Related Items (5)
Cites Work
- Unnamed Item
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Résolution des systèmes d'équations algébriques
- Vandermonde matrices, NP-completeness and transversal subspaces
- Complexity of solving parametric polynomial systems
- Efficient absolute factorization of polynomials with parametric coefficients
- Solving parametric polynomial systems
- Computations with parameters: a theoretical background
- A bound for the degree of a system of equations determining the variety of reducible polynomials
This page was built for publication: Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I