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

DOI10.1007/s10958-006-0109-7zbMath1089.68500OpenAlexW2065395241MaRDI QIDQ2494566

No author found.

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 computer science (68-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to field theory (12-06)

Cites Work

• Matrix multiplication via arithmetic progressions
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations
• Factoring polynomials with rational coefficients
• On Hensel factorization. I
• Factorization of Multivariate Polynomials Over Finite Fields
• Multivariate Polynomial Factorization
• Complexity of quantifier elimination in the theory of ordinary differential equations
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item