On the complexity of recognizing the Hilbert basis of a linear Diophantine system (Q5958323): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4938414 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4723808 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of integer programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3221403 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818127 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Unification Algorithm for Associative-Commutative Functions / rank | |||
Normal rank | |||
Latest revision as of 22:22, 3 June 2024
scientific article; zbMATH DE number 1715324
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of recognizing the Hilbert basis of a linear Diophantine system |
scientific article; zbMATH DE number 1715324 |
Statements
On the complexity of recognizing the Hilbert basis of a linear Diophantine system (English)
0 references
3 March 2002
0 references
computational complexity
0 references
homogeneous linear Diophantine system
0 references
Hilbert basis
0 references
coNP-completeness
0 references
completeness in the strong sense
0 references
0 references
