On the complexity of counting the Hilbert basis of a linear Diophantine system

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

Volumn 1705 LNAI, Issue , 1999, Pages 13-32

  Hermann, Miki ^a   Juban, Laurent ^a   Kolaitis, Phokion G ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIOPHANTINE SYSTEM; HILBERT BASIS; HOMOGENEOUS SYSTEM; LINEAR DIOPHANTINE EQUATIONS; LOWER AND UPPER BOUNDS;

COMPUTER CIRCUITS;

EID: 0006984691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_2     Document Type: Conference Paper

References (38)

1. A. Boudet, E. Contejean, and H. Devie. A new AC unification algorithm with a new algorithm for solving Diophantine equations. In Proceedings 5th Lies, Philadelphia (PA, USA), pages 289-299, June 1990.
2. D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3:203-216, 1987.
3. F. Baader and T. Nipkow. Term rewriting and all that. ambridge University Press, 1998.
4. A. Boudet. Competing for the AC-unification race. Journal of Automated Reasoning, 11(2):185-212, 1993.
5. E. Contejean and H. Devie. An efficient incremental algorithm for solving systems of linear Diophantine equations. Information and Computation, 113(1):143-172, 1994.
6. M. Clausen and A. Fortenbacher. Efficient solution of linear Diophantine equations. Journal of Symbolic Computation, 8(1-2) :201-216, 1989.
7. A. Durand, M. Hermann, and L. Jubzin. On the complexity of recognizing the Hilbert basis of a Unear Diophantine system. In L. Pacholski, editor. Proceedings 24th MFCS, Szklarska Poreba (Poland), LNCS, Springer-Verlag, September 1999.
8. E. Domenjoud. Outils pour la diduction automatique dans les thiories associative-commutatives. PhD thesis, University Henri Poincare, Nancy, Frince, September 1991.
9. E. Domenjoud. Solving systems of linccir Diophcintine equations: An algebraic approach. In A. Tarlecki, editor, Proceedings 16th MFCS, Kazimierz Dolny (Poland), LNCS 520, pages 141-150. Springer-Verlag, September 1991.
10. A. Durctnd. Personal communication, June 1999.
11. A. A. Elimcim and S. E. Elmaghraby. On the reduction method for integer linccir programs II. Discrete Applied Mathematics, 12(3):241-260, 1985.
12. F. Fages. Associative commutative unification. Journal of Symbolic Computation, 3(3):257-275, 1987.
13. M. R. Carey and D. S. Johnson. Computers and ntractability: A guide to the theory of NP-completeness. W.H. Freeman and Co, 1979.
14. P. Gordan. Ueber die Auflosung linearen Gleichungen mit reellen Coefficienten. Mathematische Annalen, 6:23-28, 1873.
15. D. Hilbert. Ueber die Theorie der algebreuschen Formen. Mathematische Annalen, 36:473-534, 1890.
16. M. Hermann Jind P. G. Kolaitis. The complexity of counting problems in equational matching. Journal of Symbolic Computation, 20(3):343-362, 1995.
17. M. Hermann and P. G. Kolaitis. Computational complexity of simultaneous elementary matching problems. In J. Wiedermann and P. Hdjek, editors. Proceedings 20th MFCS, Prague (Czech Republic), LNCS 969, pages 359-370. Springer-Verlag, August 1995.
18. A. Herold and J. H. Siekmann. Unification in Abelian semigroups. Journal of Automated Reasoning, 3(3):247-283, 1987.
19. G. Huet. An aJgorithm to generate the basis of solutions to homogeneous linear Diophantine equations. Information Processing Letters, 7(3):144-147, 1978.
20. L. A. Hemaspaandra and H. Vollmer. The satanic notations: Counting classes beyond # P and other definitional adventures. SIGACT News, 26(1):2-13, March 1995.
21. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257-321. MIT Press, Cambridge (MA, USA), 1991.
22. D. S. Johnson. A cat2ilog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, chapter 2, pages 67-161. North-Holland, Amsterdam, 1990.
23. L. Juban. Comptage de I'ensemble des elements de la base de Hilbert d'un systéme d'e ́quations diophsmtiennes lineaires. Technical Report 98-R-066, LORIA, 1998.
24. J.-L. Lambert. Une borne pour les générateurs des solutions entié res positives d'une é quation diophantienne lineaire. Compte-rendus de I'Acadimie des Sciences de Paris, 305(l):39-40, 1987.
25. D. Leinkford. Non-negative integer basis algorithms for linear equations with integer coefficients. Journal of Automated Reasoning, 5(l):25-35, 1989.
26. P. Lincoln and J. Christian. Adventures in associative-commutative unification. Journal of Symbolic Computation, 8(l-2):217-240, 1989.
27. C. H. Papswiimitriou. On the complexity of integer rogramming. Journal of the Association for Computing Machinery, 28(4):765-768, 1981.
28. C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
29. L. Pottier. Minimal solutions of lineau: Diophantine systems: bounds and algorithms. In R.V. Book, editor. Proceedings 4th RTA, Como (Italy), LNCS 488, pages 162-173. Springer-Verlag, April 1991.
30. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, 1986.
31. M. Stickel. A complete unification stlgorithm for associative-commutative functions. In Proceedings 4th IJCAI, Tbilisi (USSR), pages 71-82, 1975.
32. M. Stickel. A unification algorithm for associative-commutative functions. Journal of the Association for Computing Machinery, 28(3):423-434, 1981.
33. S. Toda. On the computational power of PP and RP. In Proceedings 30th FOCS, Research Triangle Park (NC, USA), pages 514-519, 1989.
34. S. Toda. Computational complexity of counting complexity classes. PhD thesis, Tokyo Institute of Technology, Department of Computer Science, Tokyo, Japan, 1991.
35. S. Toda and O. Watanabe. Polynomial-time 1-Turing reductions fi-om #PH to # P. Theoretical Computer Science, 100(1):205-221, 1992.
36. L. G. Valiant. The complexity of computing the permcinent. Theoretical Computer Science, 8(2):189-201, 1979.
37. L. G. Valiant. The complexity of enumeration and eUability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
38. V. Zankó P-completeness via mainy-one reductions. International Journal of Foundations of Computer Science, 2(l):77-82, 1991.