Alexander L. Chistov

Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic

Alexander L. Chistov, A. Chistov, 1996, J. Symb. Comput..

Polynomial time algorithms for modules over finite dimensional algebras

Marek Karpinski, Gábor Ivanyos, Alexander L. Chistov, 1997, ISSAC.

Polynomial Complexity of the Newton-Puiseux Algorithm

Alexander L. Chistov, 1986, MFCS.

Vandermonde Matrices, NP-Completeness, and Transversal Subspaces

Leonid Gurvits, Pascal Koiran, Hervé Fournier, 2003, Found. Comput. Math..

Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic

Alexander L. Chistov, A. Chistov, 1985, FCT.

Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields

Dima Grigoriev, Alexander L. Chistov, A. Chistov, 1984, MFCS.

Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties

Alexander L. Chistov, 2006, CSR.

Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic

Alexander L. Chistov, A. Chistov, 1997 .