scientific article
From MaRDI portal
Publication:3041304
zbMath0526.12002MaRDI QIDQ3041304
Erich L. Kaltofen, Joachim von zur Gathen
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite fieldspolynomial factorizationpolynomial in two variablespolynomial-time algorithmprobabilistic algorithmHensel lemma
Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
Fast parallel absolute irreducibility testing ⋮ Unnamed Item ⋮ Approximate factorization of multivariate polynomials and absolute irreducibility testing ⋮ A unified method for multivariate polynomial factorizations ⋮ Factoring multivariate polynomials over finite fields