A. L. Chistov

From MaRDI portal
(Redirected from Person:677032)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An effective algorithm for deciding the solvability of a system of polynomial equations over \(p\)-adic integers
St. Petersburg Mathematical Journal
2022-11-17Paper
An effective construction of a small number of equations defining an algebraic variety
Journal of Mathematical Sciences (New York)
2022-06-16Paper
Subexponential-time computation of isolated primary components of a polynomial ideal
Journal of Mathematical Sciences (New York)
2021-05-26Paper
Efficient estimation of roots from the field of fractional power series of a given polynomial in nonzero characteristic
Journal of Mathematical Sciences (New York)
2021-05-26Paper
Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
Journal of Mathematical Sciences (New York)
2020-09-29Paper
On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic
Doklady Mathematics
2020-06-24Paper
Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
Journal of Mathematical Sciences (New York)
2020-03-25Paper
Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
Journal of Mathematical Sciences (New York)
2018-08-16Paper
Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I
St. Petersburg Mathematical Journal
2017-10-17Paper
Efficient absolute factorization of polynomials with parametric coefficients
Journal of Mathematical Sciences (New York)
2017-10-04Paper
Computations with parameters: a theoretical background
Journal of Mathematical Sciences (New York)
2016-07-19Paper
A deterministic polynomial-time algorithm for the first Bertini theorem. III
Journal of Mathematical Sciences (New York)
2015-10-29Paper
A deterministic polynomial-time algorithm for the first Bertini theorem. II
Journal of Mathematical Sciences (New York)
2015-02-20Paper
Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic
Journal of Mathematical Sciences (New York)
2015-02-20Paper
A deterministic polynomial-time algorithm for the first Bertini theorem. I
Journal of Mathematical Sciences (New York)
2014-09-25Paper
An overview of effective normalization of a projective algebraic variety nonsingular in codimension one
Journal of Mathematical Sciences (New York)
2014-06-06Paper
Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)
Journal of Mathematical Sciences (New York)
2014-01-17Paper
A bound for the degree of a system of equations determining the variety of reducible polynomials
St. Petersburg Mathematical Journal
2013-09-16Paper
An effective version of the first Bertini theorem in nonzero characteristic and its applications
Journal of Mathematical Sciences (New York)
2013-07-30Paper
An improvement of the complexity bound for solving systems of polynomial equations
Journal of Mathematical Sciences (New York)
2012-11-27Paper
Complexity of a standard basis of a \(D\)-module.
St. Petersburg Mathematical Journal
2011-03-02Paper
Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
St. Petersburg Mathematical Journal
2011-03-02Paper
Inequalities for Hilbert functions and primary decompositions
St. Petersburg Mathematical Journal
2011-03-02Paper
Effective normalization of a nonsingular in codimension one algebraic variety
Doklady Mathematics
2010-02-05Paper
Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV.
Journal of Mathematical Sciences (New York)
2009-11-13Paper
On the construction of a family of transversal subspaces over finite fields
Linear Algebra and its Applications
2008-06-17Paper
Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties
Computer Science – Theory and Applications
2007-05-02Paper
Complexity of Janet basis of a D-module2007-04-10Paper
scientific article; zbMATH DE number 2247398 (Why is no real title available?)2006-01-16Paper
scientific article; zbMATH DE number 2247398 (Why is no real title available?)2006-01-16Paper
Monodromy and irreducibility criteria with algorithmic applications in characteristic zero
Journal of Mathematical Sciences (New York)
2006-01-03Paper
scientific article; zbMATH DE number 2214061 (Why is no real title available?)2005-10-13Paper
scientific article; zbMATH DE number 2214061 (Why is no real title available?)2005-10-13Paper
Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I
Journal of Mathematical Sciences
2005-10-11Paper
Vandermonde matrices, NP-completeness and transversal subspaces
Foundations of Computational Mathematics
2004-05-27Paper
Efficient smooth stratification of an algebraic variety in zero characteristic and its applications
Journal of Mathematical Sciences (New York)
2003-08-15Paper
Polynomial-time computation of the degree of algebraic varieties in zero characteristic and its applications.
Journal of Mathematical Sciences (New York)
2002-04-14Paper
Strong version of the basic deciding algorithm for the existential theory of real fields
Journal of Mathematical Sciences (New York)
2001-10-30Paper
Effective construction of local parameters of irreducible components of an algebraic variety.2001-01-01Paper
scientific article; zbMATH DE number 1253966 (Why is no real title available?)1999-05-30Paper
Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic
Journal of Pure and Applied Algebra
1998-07-23Paper
Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
Journal of Symbolic Computation
1998-06-23Paper
Polynomial complexity algorithms for computational problems in the theory of algebraic curves
Journal of Soviet Mathematics
1993-09-15Paper
scientific article; zbMATH DE number 66619 (Why is no real title available?)1992-09-27Paper
Algorithm of polynomial complexity for factoring polynomials over local fields
Journal of Mathematical Sciences (New York)
1992-09-27Paper
scientific article; zbMATH DE number 17525 (Why is no real title available?)1992-06-26Paper
scientific article; zbMATH DE number 5154 (Why is no real title available?)1992-06-25Paper
An algorithm of polynomial complexity for factoring polynomials over local fields1991-01-01Paper
scientific article; zbMATH DE number 4144078 (Why is no real title available?)1989-01-01Paper
scientific article; zbMATH DE number 4035950 (Why is no real title available?)1987-01-01Paper
scientific article; zbMATH DE number 4037047 (Why is no real title available?)1986-01-01Paper
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
Journal of Soviet Mathematics
1986-01-01Paper
scientific article; zbMATH DE number 3949600 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3893304 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3895043 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3959582 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3804835 (Why is no real title available?)1982-01-01Paper
Birational equivalence of tori with a cyclic splitting field
Journal of Soviet Mathematics
1981-01-01Paper
The rationality of a class of tori
Proceedings of the Steklov Institute of Mathematics
1980-01-01Paper
scientific article; zbMATH DE number 3708555 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3674334 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3557932 (Why is no real title available?)1976-01-01Paper


Research outcomes over time


This page was built for person: A. L. Chistov