The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697)
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 convex hull of a regular set of integer vectors is polyhedral and effectively computable |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The convex hull of a regular set of integer vectors is polyhedral and effectively computable |
scientific article |
Statements
The convex hull of a regular set of integer vectors is polyhedral and effectively computable (English)
0 references
18 December 2009
0 references
approximation algorithms
0 references
symbolic representation
0 references
polyhedral convex set
0 references
presburger arithmetic
0 references
0.8347198963165283
0 references
0.7767915725708008
0 references
0.7646198272705078
0 references
0.7566065192222595
0 references
