| 2006 |
|---|
| 7 | EE | Alexander L. Chistov:
Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties.
CSR 2006: 137-146 |
| 2003 |
|---|
| 6 | EE | Alexander L. Chistov,
Hervé Fournier,
Leonid Gurvits,
Pascal Koiran:
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces.
Foundations of Computational Mathematics 3(4): 421-427 (2003) |
| 1997 |
|---|
| 5 | | Alexander L. Chistov,
Gábor Ivanyos,
Marek Karpinski:
Polynomial Time Algorithms for Modules over Finite Dimensional Algebras.
ISSAC 1997: 68-74 |
| 1996 |
|---|
| 4 | | Alexander L. Chistov:
Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic.
J. Symb. Comput. 22(1): 1-25 (1996) |
| 1986 |
|---|
| 3 | | Alexander L. Chistov:
Polynomial Complexity of the Newton-Puiseux Algorithm.
MFCS 1986: 247-255 |
| 1985 |
|---|
| 2 | | Alexander L. Chistov:
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic.
FCT 1985: 63-69 |
| 1984 |
|---|
| 1 | | Alexander L. Chistov,
Dima Grigoriev:
Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields.
MFCS 1984: 17-31 |
