On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616)
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 722489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of some basic problems in computational convexity. I. Containment problems |
scientific article; zbMATH DE number 722489 |
Statements
On the complexity of some basic problems in computational convexity. I. Containment problems (English)
0 references
6 November 1995
0 references
computational convexity
0 references
pseudoboolean programming
0 references
sensitivity analysis
0 references
linear programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7775222659111023
0 references
