scientific article; zbMATH DE number 5244190

zbMATH Open1132.94012MaRDI QIDQ5446299FDOQ5446299

Authors: Radomir S. Stanković, Claudio Moraga, Dragan Janković 

Publication date: 6 March 2008

Title of this publication is not available (Why is that?)

Recommendations

• Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• Polynomial evaluation over finite fields: new algorithms and complexity bounds
• The equivariant complexity of multiplication in finite field extensions
• On the complexity of multiplication in finite fields
• Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
• On the complexity of computing integral bases of function fields
• ALGORITHMS FOR GALOIS GROUP COMPUTATIONS OVER MULTIVARIATE FUNCTION FIELDS

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (5)

• Title not available (Why is that?)
• Determining minimized Galois field expressions for ternary functions by using special normal form
• A formal approach to designing multiple-valued arithmetic circuits
• Title not available (Why is that?)
• Title not available (Why is that?)

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