scientific article
From MaRDI portal
Publication:3481814
zbMath0703.11070MaRDI QIDQ3481814
Publication date: 1989
Full work available at URL: https://eudml.org/doc/68046
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)
Related Items (5)
Smoothness and factoring polynomials over finite fields ⋮ Factoring polynomials over finite fields: A survey ⋮ On the deterministic complexity of factoring polynomials ⋮ Permutation group approach to association schemes ⋮ Finding irreducible and primitive polynomials
This page was built for publication:
