Theory of computational complexity. Part 9. Transl. from the Russian.

DOI10.1007/S10958-006-0109-7MaRDI QIDQ2494566zbMATH OpenOpenAlexFDO

Authors

Publication date 29 June 2006

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-006-0109-7

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to field theory (12-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Review text

The articles of this volume are translations from the series ``Zap. Nauchn. Semin. POMI 316 (2004; Zbl 1065.68003) and have been reviewed individually. The preceding collection (8, 2005) has been reviewed (see Zbl 1078.68520 and Zbl 1078.68521).

Recommendations

• Theory of computational complexity. Part 8. Transl. from the Russian
• Theory of computational complexity. Part 7. Transl. from the Russian
• scientific article; zbMATH DE number 2174429
• scientific article; zbMATH DE number 2243558
• Computing mathematics and cybernetics---3

Cites work

• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Complexity of quantifier elimination in the theory of ordinary differential equations
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials with rational coefficients
• Factorization of Multivariate Polynomials Over Finite Fields
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations
• scientific article; zbMATH DE number 3823145 (Why is no real title available?)
• scientific article; zbMATH DE number 42759 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 3895043 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• Modern computer algebra
• Multivariate Polynomial Factorization
• On Hensel factorization. I

Cited in

(5)

• Theory of computational complexity. Part 7. Transl. from the Russian
• Computational complexity theory. Part 10. Transl. from the Russian.
• Theory of computational complexity. Part 8. Transl. from the Russian
• Combinatorics and graph theory. Part III. Transl. from the Russian.
• scientific article; zbMATH DE number 2174429 (Why is no real title available?)

This page was built for publication: Theory of computational complexity. Part 9. Transl. from the Russian.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494566)