Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by F R Henríquez
Low Complexity Cubing and Cube Root Computation Over $\F_{3^m}$ in Polynomial Basis
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
Related publications
Low Space Complexity Multiplication Over Binary Fields With Dickson Polynomial Representation
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
Fast Gröbner Basis Computation and Polynomial Reduction for Generic Bivariate Ideals
Applicable Algebra in Engineering, Communications and Computing
Applied Mathematics
Number Theory
Algebra
Multiplicative Complexity of Polynomial Multiplication Over Finite Fields
Low Time Complexity Algorithms for Path Computation in Cayley Graphs
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Cube Theory and K-Error Linear Complexity Profile
International Journal of Security and its Applications
Computer Science
Low-Complexity Computation of Visual Information Fidelity in the Discrete Wavelet Domain
CMOS Analog Cubing Circuits for Radio-Over-Fiber Predistortion
A Low-Complexity Approach to Computation of the Discrete Fractional Fourier Transform
Circuits, Systems, and Signal Processing
Applied Mathematics
Signal Processing
GF(2/sup M/) Multiplication and Division Over the Dual Basis
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software