The complexity of facets (and some facets of complexity) (Q1061485): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(84)90068-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093454413 / rank | |||
Normal rank | |||
Revision as of 22:02, 19 March 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
