论文信息 - An Elementary Algorithmic Problem from an Advanced Standpoint

An Elementary Algorithmic Problem from an Advanced Standpoint

An optimal algorithm which finds all the solutions, over the nonnegative integers of an equation of the form ax1+bx2+cx3=m, a, b, c, m positive integers, is given. The algorithm is polynomial in the length of the input and is based on advanced concepts and methods. The algorithm is not based on Lenstra's integer programming algorithm.

Azaria Paz

[1] E. Selmer,et al. On the linear diophantine problem of Frobenius. , 1977 .

[2] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] Öyvind Beyer,et al. On the linear diophantine problem of Frobenius in three variables. , 1978 .

[5] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..