Irreducibility of multivariate polynomials
- 1 October 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 31 (2) , 225-264
- https://doi.org/10.1016/0022-0000(85)90043-1
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Factoring sparse multivariate polynomialsJournal of Computer and System Sciences, 1985
- Factoring multivariate polynomials over finite fieldsJournal of Computer and System Sciences, 1985
- Fast parallel absolute irreducibility testingJournal of Symbolic Computation, 1985
- Factorization of multivariate polynomials over finite fieldsMathematics of Computation, 1985
- Factoring multivariate integral polynomialsTheoretical Computer Science, 1984
- Finding the number of factors of a polynomialJournal of Algorithms, 1984
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- On Hensel factorization, IJournal of Number Theory, 1969
- Ueber die Irreducibilität ganzer rationaler Functionen mit ganzzahligen Coefficienten.Journal für die reine und angewandte Mathematik (Crelles Journal), 1892