A note on the NP-hardness of the consecutive block minimization problem (Q4468895): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/1475-3995.00387 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011999990 / rank | |||
Normal rank | |||
Latest revision as of 21:09, 19 March 2024
scientific article; zbMATH DE number 2073895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the NP-hardness of the consecutive block minimization problem |
scientific article; zbMATH DE number 2073895 |
Statements
A note on the NP-hardness of the consecutive block minimization problem (English)
0 references
11 June 2004
0 references
