|
Zapiski Nauchnykh Seminarov POMI, 2011, Volume 390, Pages 299–306
(Mi znsl4555)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
An improvement of the complexity bound for solving systems of polynomial equations
A. L. Chistov St. Petersburg Department of Steklov Mathematical Institute, St. Petersburg, Russia
Abstract:
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.
Key words and phrases:
polynomial systems, efficient algorithm, algebraic varieties, irreducible components.
Received: 21.09.2011
Citation:
A. L. Chistov, “An improvement of the complexity bound for solving systems of polynomial equations”, Representation theory, dynamical systems, combinatorial methods. Part XX, Zap. Nauchn. Sem. POMI, 390, POMI, St. Petersburg, 2011, 299–306; J. Math. Sci. (N. Y.), 181:6 (2012), 921–924
Linking options:
https://www.mathnet.ru/eng/znsl4555 https://www.mathnet.ru/eng/znsl/v390/p299
|
Statistics & downloads: |
Abstract page: | 236 | Full-text PDF : | 72 | References: | 48 |
|