38557
Calculating a greatest common divisor is an essential step in several integer factorization algorithms , such as Pollard 's rho algorithm , Shor 's algorithm , Dixon 's factorization method and the Lenstra elliptic curve factorization .
 Pollard, Shor, Dixon, Lenstra
Please list all entity words in the text that fit the category. Output format is "word1, word2". 
Option: location, person, organization 
Text: {0} 
Answer:
 Pollard, Shor, Dixon, Lenstra