The three column bandpass problem is solvable in linear time (Q620937): 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/j.tcs.2010.09.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984779023 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The bandpass problem: Combinatorial optimization and library of problems / rank | |||
Normal rank | |||
Latest revision as of 16:57, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The three column bandpass problem is solvable in linear time |
scientific article |
Statements
The three column bandpass problem is solvable in linear time (English)
0 references
2 February 2011
0 references
bandpass problem
0 references
exact algorithm
0 references
polynomial time solvable
0 references
