A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions (Q4785628)
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 1848446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions |
scientific article; zbMATH DE number 1848446 |
Statements
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions (English)
0 references
5 January 2003
0 references
Heilbronn's triangle problem
0 references
arrangements of simplices
0 references
independent sets in hypergraphs
0 references
0.9085380434989928
0 references
0.9085380434989928
0 references
0.9038583636283876
0 references
