A divide and conquer algorithm for \(d\)-dimensional arrangement (Q2934636)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A divide and conquer algorithm for d-dimensional arrangement |
scientific article; zbMATH DE number 6381682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide and conquer algorithm for \(d\)-dimensional arrangement |
scientific article; zbMATH DE number 6381682 |
Statements
18 December 2014
0 references
0.861010730266571
0 references
0.7954207062721252
0 references
0.7939128279685974
0 references
0.7873377799987793
0 references
0.7833846211433411
0 references
