Shortest path in a polygon using sublinear space (Q2970464)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6698320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path in a polygon using sublinear space |
scientific article; zbMATH DE number 6698320 |
Statements
30 March 2017
0 references
Shortest path in a polygon using sublinear space (English)
0 references
0.9999046921730042
0 references
0.8330504894256592
0 references
0.8311306238174438
0 references
0.8122075796127319
0 references
0.8082835078239441
0 references
