Cyclic ordering is NP-complete (Q1248373): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(77)90005-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2132421209 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partial and complete cyclic orders / rank | |||
Normal rank | |||
Latest revision as of 23:57, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cyclic ordering is NP-complete |
scientific article |
Statements
Cyclic ordering is NP-complete (English)
0 references
1978
0 references
