A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions (Q4785628): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:21, 5 March 2024
scientific article; zbMATH DE number 1848446
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
