On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time |
scientific article |
Statements
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (English)
0 references
3 May 1999
0 references
RAM model of computation
0 references
