The complexity of recognizing geometric hypergraphs (Q6560147)
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: The complexity of recognizing geometric hypergraphs |
scientific article; zbMATH DE number 7869502
| 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 7869502 |
Statements
The complexity of recognizing geometric hypergraphs (English)
0 references
21 June 2024
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
0 references
0 references
0 references
0 references
0 references
0 references
