On the complexity of counting the Hilbert basis of a linear Diophantine system - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

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

Résumé

We investigate the computational complexity of counting the Hilbert basis of a homogeneous system of linear Diophantine equations. We establish lower and upper bounds on the complexity of this problem by showing that counting the Hilbert basis is #P-hard and belongs to the class #NP. Moreover, we investigate the complexity of variants obtained by restricting the number of occurrences of the variables in the system.
Fichier non déposé

Dates et versions

inria-00098753 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00098753 , version 1

Citer

Miki Hermann, Laurent Juban, Phokion G. Kolaitis. On the complexity of counting the Hilbert basis of a linear Diophantine system. 6th International Conference on Logic for Programming & Automated Reasoning - LPAR'99, Sep 1999, Tbilisi, Georgia, pp.13-32. ⟨inria-00098753⟩
62 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More