@inproceedings{10.1007/978-3-319-02297-0_11,
Abstract = {An algorithm is designed which tests solvability of a system of k polynomial equations in n variables with degrees d within complexity polynomial in {\$}n^{\{}d^{\{}3k{\}}{\}}{\$}. If the system is solvable then the algorithm yields one of its solutions. Thus, for fixed d, k the complexity of the algorithm is polynomial.},
Address = {Cham},
Author = {Grigoriev, Dima},
BookTitle = {Computer Algebra in Scientific Computing},
Editor = {Gerdt, Vladimir P. and Koepf, Wolfram and Mayr, Ernst W. and Vorozhtsov, Evgenii V.},
File = {Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees - Grigoriev2013\_Chapter\_PolynomialComplexityOfSolvingS.pdf},
ISBN = {978-3-319-02297-0},
Pages = {136--139},
Publisher = {Springer International Publishing},
Title = {Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees},
Year = {2013},
date-added = {2021-11-19 13:20:31 +0100},
date-modified = {2021-11-19 13:20:31 +0100},
doi = {10.1007/978-3-319-02297-0_11}
}
Library Size: 13G (12943 entries),
Last Updated: Apr 05, 2026, 21:58:59,
Build Time: N/A