|
Zapiski Nauchnykh Seminarov POMI, 2020, Volume 498, Pages 64–74
(Mi znsl7036)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
I
Subexponential-time computation of isolated primary components of a polynomial ideal
A. L. Chistov St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences
Abstract:
We suggest an algorithm for constructing all the isolated primary components of a given polynomial ideal. At the output, they are determined by systems of generators up to embedded components, and also as kernels of some homomorphisms. The complexity of this algorithm is subexponential in the size of the input data.
Key words and phrases:
formal power series, fractional power series, nonzero characteristic, Newton–Puiseux algorithm, estimations of irreducible factors.
Received: 31.08.2020
Citation:
A. L. Chistov, “Subexponential-time computation of isolated primary components of a polynomial ideal”, Representation theory, dynamical systems, combinatorial methods. Part XXXI, Zap. Nauchn. Sem. POMI, 498, POMI, St. Petersburg, 2020, 64–74
Linking options:
https://www.mathnet.ru/eng/znsl7036 https://www.mathnet.ru/eng/znsl/v498/p64
|
Statistics & downloads: |
Abstract page: | 86 | Full-text PDF : | 17 | References: | 15 |
|