Login / Signup

On the Asymptotic Analysis of the Euclidean Algorithm.

Graham H. Norton
Published in: J. Symb. Comput. (1990)
Keyphrases
  • dynamic programming
  • asymptotic analysis
  • learning algorithm
  • cost function
  • knapsack problem
  • neural network
  • optimal solution
  • computational complexity
  • np hard
  • worst case
  • linear programming
  • sensitivity analysis