An improvement of the complexity bound for solving systems of polynomial equations
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XX, Tome 390 (2011), pp. 299-306
Voir la notice de l'article provenant de la source Math-Net.Ru
In 1984 the author suggested an algorithm for solving systems of polynomial equations. At present we modify it and improve bounds for its complexity, degrees and lengths of coefficients from the ground field of the elements constructed by this algorithm.
@article{ZNSL_2011_390_a11,
author = {A. L. Chistov},
title = {An improvement of the complexity bound for solving systems of polynomial equations},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {299--306},
publisher = {mathdoc},
volume = {390},
year = {2011},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2011_390_a11/}
}
A. L. Chistov. An improvement of the complexity bound for solving systems of polynomial equations. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XX, Tome 390 (2011), pp. 299-306. http://geodesic.mathdoc.fr/item/ZNSL_2011_390_a11/