The complexity of recognizing geometric hypergraphs (Q6988916)
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 8035324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of recognizing geometric hypergraphs |
scientific article; zbMATH DE number 8035324 |
Statements
The complexity of recognizing geometric hypergraphs (English)
0 references
30 April 2025
0 references
hypergraph
0 references
geometric hypergraph
0 references
recognition
0 references
computational complexity
0 references
convex
0 references
ball
0 references
ellipsoid
0 references
halfplane
0 references
halfspace
0 references
translate
0 references
homothet
0 references
bi-curved
0 references
difference-separable
0 references
