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