Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic.
Thorsten KleinjungBenjamin WesolowskiPublished in: CoRR (2019)
Keyphrases
- finite number
- finite automata
- finite sets
- special case
- arbitrary size
- worst case
- approximation algorithms
- fixed number
- discrete geometry
- neural network
- ridgelet transform
- discrete version
- computer vision
- computational complexity
- real numbers
- unit length
- expressive power
- artificial intelligence
- genetic algorithm
- machine learning
- data mining