The complexity of facets (and some facets of complexity) (Q1061485): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:43, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of facets (and some facets of complexity) |
scientific article |
Statements
The complexity of facets (and some facets of complexity) (English)
0 references
1984
0 references
The authors introduce a certain complexity class \(D^ P\) connected with combinatorial optimization problems and in particular with the facets of polytopes. \(D^ P\) is the class of all languages that are the intersection of a language in NP and a language in coNP.
0 references
complexity class
0 references
combinatorial optimization
0 references
facets of polytopes
0 references
NP
0 references
coNP
0 references
