Minimal solutions of linear diophantine systems: Bounds and algorithms

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

Volumn 488 LNCS, Issue , 1991, Pages 162-173

  Pottier, Loïc ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DIOPHANTINE SYSTEM; MINIMAL SOLUTIONS;

ARTIFICIAL INTELLIGENCE;

EID: 84947931070     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-53904-2_94     Document Type: Conference Paper

References (17)

1. L.Baratchart and L.Pottier “Un résultat sur les systèmes d’addition de vecteurs”, manuscript, INRIA Sophia Antipolis, France, feb. 1989.
2. I.Borosh and L.B.Treybig “Bounds of non-negative integral solutions of linear diophantine equations”, Proc. AMS v.55, n.2, march 1976.
3. B.Buchberger “Gröbner basis: an algorithmic method in polynomial ideal theory” Camp. Publ. Nr. 83-29. 0, nov. 1983.
4. E.Contejeanand H.Devie “Solving systems of linear diophantine equations”, UNIF’89, proc. of the third international Workshop on unification, Lambrecht, RFA 89.
5. E.Domenjoud “Solving Systems fo Linear Diophantine Equations: An Algebraic Approch”, UNIF’90, International Workshop on Unification, Leeds UK, july 1990
6. A.Galligo “Algorithmes de calcul de bases standard”, Preprint Université de Nice, France, 1985.
7. F.Giles and W.R.Pulleyblank “Total dual integrality and integer polyedra” Linear algebra and its applications, 25, pp191-196, 1979.
8. G.Huet “An algorithm to generate the basis of solutions to homogeneous linear diophantine equations”, Information Processing Letters, vol.3, No.7, 1978.
9. A.Koscielski and L.Pacholski “Exponent of periodicity of minimal solutions of word equations”, manuscript, University of Wroclaw, Poland, june 1990.
10. J.L.Lambert “Une borne pour les générateurs des solutions entières positives d’une équation diophantienne linéaire.” Comptes Rendus de l’Académie des Sciences de Paris, t.305, Séire I, pp39-40, 1987.
11. J.L.Lambert “Un problème d’accessibilité dans les réseaux de Petri” Phd thesis, theorem I.5., p 18, University of Paris-Sud, Orsay, France, 1987.
12. F.Ollivier “Le problème de l’identifiabilité structurelle globale: approche théorique, méthodes effectives et bornes de complexité”, Phd Thesis, Ecole Polytechnique, France, june 1990.
13. L.Pottier “Bornes et algorithmes de calcul des générateurs des solutions de systèmes diophantiens linéaires”, internal report, INRIA, feb. 90, Comptes Rendus de l’Académie des Sciences de Paris, t.311, Série I, p813-816,1990.
14. J.F.Romeuf “Solutions of a linear diophantine system”, UNIF’89, proc. of the third international Workshop on unification, Lambrecht, RFA 89.
15. R.P.Stanley “Combinatorics and commutative algebra”, Progress in Mathematics, Birkäuser ed., 1983.
16. L.B. Treybig “Bounds in piecewise linear topology”, Trans.AMS, v.201, 1975.
17. J.Von zur Gathen and M.Sieveking “A bound on solutions of linear integer equalities and inequalities” Proc. AMS 72, pp155-158, 1978.