SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE (Q3422224)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE |
scientific article |
Statements
SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE (English)
0 references
9 February 2007
0 references
shortest path
0 references
exact geometric computation
0 references
real RAM model, Turing model, transcendental number theory
0 references
