On the complexity of finding paths in a two-dimensional domain I: Shortest paths (Q3159412)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of finding paths in a two-dimensional domain I: Shortest paths |
scientific article |
Statements
On the complexity of finding paths in a two-dimensional domain I: Shortest paths (English)
0 references
16 February 2005
0 references
shortest path
0 references
computational complexity
0 references
polynomial time
0 references
polynomial space
0 references
computable analysis
0 references
oracle Turing machine
0 references
