An algorithm for solving systems of linear diophantine equations in naturals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1323, Issue , 1997, Pages 73-84

  Tomás, Ana Paula ^a   Filgueiras, Miguel ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALGORITHM FOR SOLVING; LINEAR DIOPHANTINE EQUATIONS; MATHEMATICAL ASPECTS; MINIMAL SOLUTIONS;

ARTIFICIAL INTELLIGENCE;

EID: 84896335080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023912     Document Type: Conference Paper

References (16)

1. Boudet, A., Contejean E., and Devie, H.: A new reunification algorithm with an algorithm for solving systems of Diophantine equations. In Proceedings of the 5th Conference on Logic and Computer Science, IEEE, 289-299, 1990.
2. Clausen, M., and Fortenbacher, A.: Efficient solution of linear Diophantine equations. J. Symbolic Computation, 8, 201-216, 1989.
3. Domenjoud, E.: Outiłs pour la Deduction Automatique dans les Theories Associatives-Commutatives. These de doctorat, Université de Nancy I, 1991.
4. Elliott, E. B.: On linear homogenous Diophantine equations. Quart. J. Pure Appl. Math., 34, 348-377, 1903.
5. Filgueiras, M., and Tomás, A. P.: Fast Methods for Solving Linear Diophantine Equations. In M. Filgueiras, L. Damas (eds.) Progress in Artificial Intelligence -6th Portuguese Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence 727, Springer-Verlag, 297-306, 1993.
6. Filgueiras, M., and Tomás, A. P.: A Fast Method for Finding the Basis of Nonnegative Solutions to a Linear Diophantine Equation. J. Symbolic Computation, 19, 507-526, 1995.
7. Huet, G.: An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations. Information Processing Letters, 7(3), 1978.
8. Lambert, J.-L.: Une borne pour les générateurs des solutions entières positives d'une equation diophantienne linéaire. Comptes Rendus de l'Académie des Sciences de Paris, t. 305, série I, 39-40, 1987.
9. MacMahon, P.: Combinatory Analysis, 2. Chelsea Publishing Co., 1918.
10. Moulinet-Ossola, C.: Algorithmique des Réseaux et des Systèmes Diophantiens Linéaires. These de doctorat, Université de Nice Sophia-Antipolis, 1995.
11. Pottier, L.: Minimal solutions of linear diophantine systems: bounds and algorithms. In R. V. Book (ed.), Proceedings of the 4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 488, Springer-Verlag, 162-173, 1991.
12. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience, 1986.
13. Stanley, R.P.: Enumerative Combinatorics, Vol I, The Wadsworth & Brooks/Cole Mathematics Series, 1986.
14. Tomás, A. P., Filgueiras, M.: Solving linear Diophantine equations using the geometric structure of the solution space. In H. Common (ed.), Rewriting Techniques and Applications. Proceedings, Lecture Notes in Computer Science 1232, Springer-Verlag, 269-283, 1997.
15. Tomás, A. P.: On Solving Linear Diophantine Constraints. Tese de Doutoramento, Faculdade de Ciências da Universidade do Porto, 1997.
16. Tomás, A. P., Filgueiras, M.: Exploiting the Geometric Structure of the Solution Space in Solving Linear Diophantine Equations. Internal Report, DCC & LIACC, Universidade do Porto, 1997.