scientific article; zbMATH DE number 4152517

MaRDI QIDQ3481814zbMATH OpenFDO

Authors S. A. Evdokimov

Publication date 1989

Full work available at URL https://eudml.org/doc/68046

zbMATH Keywords

complexitydeterministic algorithmfactorizationGeneralized Riemann Hypothesis

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05)

Recommendations

• Generalized riemann hypothesis and factoring polynomials over finite fields
• scientific article; zbMATH DE number 799779
• Factoring polynomials over special finite fields
• Factoring polynomials over finite fields
• Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields

Cited in

(11)

• Permutation group approach to association schemes
• Solvability by radicals is in polynomial time
• Smoothness and factoring polynomials over finite fields
• Finding irreducible and primitive polynomials
• Factorizations, Riemann-Hilbert problems and the corona theorem
• Generalized riemann hypothesis and factoring polynomials over finite fields
• Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
• scientific article; zbMATH DE number 4095549 (Why is no real title available?)
• scientific article; zbMATH DE number 799779 (Why is no real title available?)
• Factoring polynomials over finite fields: A survey
• On the deterministic complexity of factoring polynomials

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 Q3481814)