On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time |
scientific article; zbMATH DE number 1283754
| 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; zbMATH DE number 1283754 |
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
0.89603734
0 references
0.87647414
0 references
0.8695211
0 references
0 references
0.85451496
0 references
0 references
0.8508131
0 references
0.84956133
0 references
