The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity (Q3088036): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:48, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity |
scientific article |
Statements
The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity (English)
0 references
17 August 2011
0 references
