On recognizing integer polyhedra (Q2639642): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3818127 / rank | |||
Normal rank | |||
Latest revision as of 13:12, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On recognizing integer polyhedra |
scientific article |
Statements
On recognizing integer polyhedra (English)
0 references
1990
0 references
Given a rational system Ax\(\leq b\) of linear inequalities, does it determine an integer polyhedron? In \textit{A. Schrijver} [Discrete Appl. Math. 14, 111-133 (1986; Zbl 0602.90111)] noted that this problem is in co-NP. He asked whether this problem is also in NP. In this note, the authors proved that the problem is co-NP complete. So, it is unlikely in NP.
0 references
rational system of linear inequalities
0 references
integer polyhedron
0 references
