Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions \(d\geq 4\) (Q6620527)
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: Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions \(d\geq 4\) |
scientific article; zbMATH DE number 7927893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions \(d\geq 4\) |
scientific article; zbMATH DE number 7927893 |
Statements
Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions \(d\geq 4\) (English)
0 references
16 October 2024
0 references
fine-grained complexity theory
0 references
non-combinatorial lower bounds
0 references
computational geometry
0 references
clique detection
0 references
