On the complexity of recognizing the Hilbert basis of a linear Diophantine system (Q5958323): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:24, 30 January 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
