Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
DOI10.1007/S10958-018-3868-ZzbMATH Open1405.13050OpenAlexW2803229928WikidataQ129753375 ScholiaQ129753375MaRDI QIDQ1661547FDOQ1661547
Authors: A. L. Chistov 
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
Recommendations
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
- Solving parametric polynomial systems
- scientific article; zbMATH DE number 1263377
- Complexity of solving parametric polynomial systems
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)
Cites Work
- Complexity of solving parametric polynomial systems
- Vandermonde matrices, NP-completeness and transversal subspaces
- Solving parametric polynomial systems
- Résolution des systèmes d'équations algébriques
- Title not available (Why is that?)
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- A bound for the degree of a system of equations determining the variety of reducible polynomials
- Efficient absolute factorization of polynomials with parametric coefficients
- Computations with parameters: a theoretical background
Cited In (7)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
- Title not available (Why is that?)
- Continuity loci for polynomial systems
- An effective construction of a small number of equations defining an algebraic variety
- Subexponential-time computation of isolated primary components of a polynomial ideal
- An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
This page was built for publication: Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661547)
