A. L. Chistov

Steklov Mathematical Institute — Russia

Computer Science · Physical Sciences

12h-index515citations48works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Polynomial and algebraic computation(39), Algebraic Geometry and Number Theory(20), Commutative Algebra and Its Applications(13), Coding theory and cryptography(10), Advanced Numerical Analysis Techniques(9)

Publications48 total

An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers
St Petersburg Mathematical Journal·2022· 1 cited
Subexponential-Time Computation of Isolated Primary Components of a Polynomial Ideal
Journal of Mathematical Sciences·2021Open Access
Systems with Parameters, or Efficiently Solving Systems of Polynomial Equations: 33 Years Later. III
Journal of Mathematical Sciences·2020· 1 cited
On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic
Доклады Академии наук·2019Open Access
Systems with Parameters, or Efficiently Solving Systems of Polynomial Equations 33 Years Later. II
Journal of Mathematical Sciences·2019· 3 cited
Systems with Parameters, or Efficiently Solving Systems of Polynomial Equations: 33 Years Later. I
Journal of Mathematical Sciences·2018· 5 cited
Efficient Absolute Factorization of Polynomials with Parametric Coefficients
Journal of Mathematical Sciences·2017· 4 cited
Computations with Parameters: A Theoretical Background
Journal of Mathematical Sciences·2016· 4 cited
A Deterministic Polynomial-Time Algorithm for the First Bertini Theorem. III
Journal of Mathematical Sciences·2015
A Deterministic Polynomial-Time Algorithm for the First Bertini Theorem. II
Journal of Mathematical Sciences·2014· 1 cited
A Deterministic Polynomial-Time Algorithm for the First Bertini Theorem. I
Journal of Mathematical Sciences·2014· 3 cited
A bound for the degree of a system of equations determining the variety of reducible polynomials
St Petersburg Mathematical Journal·2013· 8 citedOpen Access
An effective version of the first Bertini theorem in nonzero characteristic and its applications
Journal of Mathematical Sciences·2013Open Access
An improvement of the complexity bound for solving systems of polynomial equations
Journal of Mathematical Sciences·2012· 12 cited
Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero)
Journal of Mathematical Sciences·2011· 1 citedOpen Access
Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
St Petersburg Mathematical Journal·2009· 14 citedOpen Access
Complexity of a standard basis of a $D$-module
St Petersburg Mathematical Journal·2009· 9 citedOpen Access
Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV
Journal of Mathematical Sciences·2009· 5 cited
Inequalities for Hilbert functions and primary decompositions
St Petersburg Mathematical Journal·2008· 1 citedOpen Access
On the construction of a family of transversal subspaces over finite fields
Linear Algebra and its Applications·2008· 2 cited
page 1 of 3Next →

Frequent Co-authors

Marek Karpiński(5), Hervé Fournier(3), Leonid Gurvits(2), Pascal Koiran(2), Dima Grigoriev(2), D. Yu. Grigor'ev(1), Gábor Ivanyos(1), D. Grigoriev(1), Sylvain Perifel(1), Olivier Chapuis(1)