Prune-and-search with limited workspace (Q473192)
From MaRDI portal
!
WARNING
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 6372035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Prune-and-search with limited workspace |
scientific article; zbMATH DE number 6372035 |
Statements
Prune-and-search with limited workspace (English)
0 references
24 November 2014
0 references
prune-and-search
0 references
space-efficient algorithms
0 references
in-place algorithms
0 references
read-only memory algorithms
0 references
minimum enclosing circle
0 references
low-dimensional linear programming
0 references
0.7951692342758179
0 references
0.7386919856071472
0 references
0.7377827763557434
0 references
0.7260249853134155
0 references
