On the complexity of recognizing the Hilbert basis of a linear Diophantine system
From MaRDI portal
Recommendations
- On the complexity of recognizing the Hilbert basis of a linear Diophantine system
- NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations
- On the complexity of counting the Hilbert basis of a linear Diophantine system.
- Recognizing conic TDI systems is hard
- On computing Hilbert bases via the Elliot--MacMahon algorithm
Cites work
- A Unification Algorithm for Associative-Commutative Functions
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3995771 (Why is no real title available?)
- On the complexity of counting the Hilbert basis of a linear Diophantine system.
- On the complexity of integer programming
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
Cited in
(4)- On the complexity of counting the Hilbert basis of a linear Diophantine system.
- On the complexity of recognizing the Hilbert basis of a linear Diophantine system
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- The complexity of almost linear diophantine problems
This page was built for publication: On the complexity of recognizing the Hilbert basis of a linear Diophantine system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958323)