Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation.
M. Anwar HasanChristophe NègrePublished in: IEEE Trans. Computers (2011)
Keyphrases
- space complexity
- worst case
- arc consistency
- artificial intelligence
- high levels
- piecewise polynomial
- binary representation
- space requirements
- floating point
- hamming distance
- representation scheme
- non binary
- temporal information
- tree representation
- search algorithm
- morphological skeleton
- worst case time complexity
- unit interval
- data structure