RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2011 Volume 390, Pages 299–306 (Mi znsl4555)

This article is cited 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.

UDC: 518.5+513.6

Received: 21.09.2011

Language: English


 English version:
Journal of Mathematical Sciences (New York), 2012, 181:6, 921–924

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024