Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
From MaRDI portal
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers ⋮ An effective construction of a small number of equations defining an algebraic variety ⋮ Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III ⋮ Subexponential-time computation of isolated primary components of a polynomial ideal ⋮ Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
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
