Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- 1 August 1986
- journal article
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 34 (4) , 1838-1882
- https://doi.org/10.1007/bf01095643
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Factorization of polynomials over a finite field and the solution of systems of algebraic equationsJournal of Mathematical Sciences, 1986
- Two reductions of graph isomorphism to problems on polynomialsJournal of Mathematical Sciences, 1982
- A polynomial-time reduction from bivariate to univariate integral polynomial factorizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A polynomial reduction from multivariate to bivariate integral polynomial factorization.Published by Association for Computing Machinery (ACM) ,1982
- Commutative algebra and computer algebraPublished by Springer Nature ,1982
- Multiplicative complexity of a bilinear form over a commutative ringPublished by Springer Nature ,1981
- Resolution des systemes d'equations algebriquesTheoretical Computer Science, 1981
- Algèbre linéaire sur $K[X_1,\dots,X_n]$ et éliminationBulletin de la Société Mathématiques de France, 1977
- The Exact Solution of Systems of Linear Equations with Polynomial CoefficientsJournal of the ACM, 1973
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967