Fast parallel absolute irreducibility testing
- 1 March 1985
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 1 (1) , 57-67
- https://doi.org/10.1016/s0747-7171(85)80029-8
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Effective Hilbert irreducibilityPublished by Springer Nature ,2005
- Computations on curvesPublished by Springer Nature ,2005
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial FactorizationSIAM Journal on Computing, 1985
- Zur arithmetischen Theorie der algebraischen GrössenPublished by Springer Nature ,1984
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Polynomial-time factorization of multivariate polynomials over finite fieldsPublished by Springer Nature ,1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- A note on the parallel complexity of computing the rank of order n matricesInformation Processing Letters, 1980
- Ein algebraisches Kriterium für absolute IrreduzibilitätMathematische Annalen, 1922