On the complexity of four polyhedral set containment problems (Q3703587)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3930723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of four polyhedral set containment problems |
scientific article; zbMATH DE number 3930723 |
Statements
On the complexity of four polyhedral set containment problems (English)
0 references
1985
0 references
H-cell
0 references
W-cell
0 references
computational complexity
0 references
set containment problems
0 references
NP- complete
0 references
0.7775222659111023
0 references
0.7775222659111023
0 references
0.7674754858016968
0 references
0.7659237384796143
0 references
0.7569149732589722
0 references
A nonempty closed convex polyhedron X can be represented either as \(X=\{x:\) Ax\(\leq b\}\), where (A,b) are given, in which case X is called an H-cell, or in the form \(X=\{x:\) \(x=U\lambda +V\mu\), \(\sum \lambda_ j=1\), \(\lambda\geq 0\), \(\mu\geq 0\}\), where (U,V) are given, in which case X is called a W-cell. This note discusses the computational complexity of certain set containment problems. The problems of determining if \(X\not\subseteq Y\), where (i) X is an H-cell and Y is a closed solid ball, (ii) X is an H-cell and Y is a W-cell, or (iii) X is a closed solid ball and Y is a W-cell, are all shown to be NP-complete, essentially verifying a conjecture of \textit{B. C. Eaves} and the first author [ibid. 23, 138-147 (1982; Zbl 0479.90064)]. Furthermore, the problem of determining whether there exists an integer point in a W-cell is shown to be NP-complete, demonstrating that regardless of the representation of X as an H-cell or W-cell, this integer containment problem is NP-complete.
0 references