scientific article; zbMATH DE number 6308159

MaRDI QIDQ4981685zbMATH OpenFDO

Authors Karim Belabas

Publication date 24 June 2014

zbMATH Keywords

deterministic algorithmspolynomial-time algorithmsfactoring polynomialsconstructing finite fieldsconstructing maps between finite fieldsrecognizing finite fieldsrepresenting finite fields

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 4152523
• Algorithms for finite field arithmetic
• scientific article; zbMATH DE number 429512
• On arithmetical algorithms over finite fields
• Algorithms for exponentiation in finite fields
• scientific article; zbMATH DE number 1594303
• Computational problems in the theory of finite fields
• Algorithms for Function Fields
• Algorithms in Algebraic Number Theory
• scientific article; zbMATH DE number 4083539

Cited in

(4)

• On arithmetical algorithms over finite fields
• scientific article; zbMATH DE number 4152523 (Why is no real title available?)
• scientific article; zbMATH DE number 4153897 (Why is no real title available?)
• scientific article; zbMATH DE number 429512 (Why is no real title available?)

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