scientific article; zbMATH DE number 3834091

MaRDI QIDQ3041304zbMATH OpenFDO

Authors Joachim von zur Gathen, Erich L. Kaltofen

Publication date 1983

zbMATH Keywords

finite fieldsHensel lemmapolynomial factorizationpolynomial in two variablespolynomial-time algorithmprobabilistic algorithm

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Cited in

(6)

• Factoring multivariate polynomials over finite fields
• Fast parallel absolute irreducibility testing
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• On learning linear functions from subset and its applications in quantum computing
• A unified method for multivariate polynomial factorizations
• Encounters in symbolic computation: ideas for the ages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3041304)