Geodesic
Subexponential-time computation of isolated primary components of a polynomial ideal
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XXXI, Tome 498 (2020), pp. 64-74

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{ZNSL_2020_498_a5,
     author = {A. L. Chistov},
     title = {Subexponential-time computation of isolated primary components of a polynomial ideal},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {64--74},
     publisher = {mathdoc},
     volume = {498},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2020_498_a5/}
}
TY  - JOUR
AU  - A. L. Chistov
TI  - Subexponential-time computation of isolated primary components of a polynomial ideal
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2020
SP  - 64
EP  - 74
VL  - 498
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2020_498_a5/
LA  - ru
ID  - ZNSL_2020_498_a5
ER  - 
%0 Journal Article
%A A. L. Chistov
%T Subexponential-time computation of isolated primary components of a polynomial ideal
%J Zapiski Nauchnykh Seminarov POMI
%D 2020
%P 64-74
%V 498
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2020_498_a5/
%G ru
%F ZNSL_2020_498_a5
A. L. Chistov. Subexponential-time computation of isolated primary components of a polynomial ideal. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial methods. Part XXXI, Tome 498 (2020), pp. 64-74. http://geodesic.mathdoc.fr/item/ZNSL_2020_498_a5/