On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
| Hi-index | 0.00 |