Lower bounds on the linear complexity of the discrete logarithm in finite fields.
Wilfried MeidlArne WinterhofPublished in: IEEE Trans. Inf. Theory (2001)
Keyphrases
- linear complexity
- lower bound
- finite number
- upper bound
- linear computational complexity
- discrete version
- upper and lower bounds
- branch and bound algorithm
- np hard
- worst case
- branch and bound
- arbitrary size
- search algorithm
- real numbers
- optimal solution
- online algorithms
- discrete geometry
- optimal cost
- vc dimension
- randomly generated problems
- neural network
- computer vision