Pages that link to "Item:Q3422224"
From MaRDI portal
The following pages link to SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE (Q3422224):
Displaying 3 items.
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901267) (← links)