Detecting points in integer cones of polytopes is double-exponentially hard (Q6545123)
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 7854677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting points in integer cones of polytopes is double-exponentially hard |
scientific article; zbMATH DE number 7854677 |
Statements
Detecting points in integer cones of polytopes is double-exponentially hard (English)
0 references
29 May 2024
0 references
