Login / Signup
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field.
Nardo Giménez
Guillermo Matera
Mariana Pérez
Melina Privitelli
Published in:
Comb. Probab. Comput. (2022)
Keyphrases
</>
dynamic programming
k means
polynomially bounded
learning algorithm
similarity measure
optimal solution
theoretical analysis
average case
machine learning
computational complexity
np hard
worst case
objective function
search algorithm
orders of magnitude
euclidean distance