The convex hull of a regular set of integer vectors is polyhedral and effectively computable

DOI10.1016/j.ipl.2005.04.004zbMath1184.68634arXiv0812.1951OpenAlexW2123615615MaRDI QIDQ1044697

Jérôme Leroux, Alain Finkel

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.1951

zbMATH Keywords

approximation algorithmssymbolic representationpolyhedral convex setpresburger arithmetic

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (2)

Convex Hull of Arithmetic Automata ⋮ COMPUTING CONVEX HULLS BY AUTOMATA ITERATION

Uses Software

• FAST

Cites Work

• Logic and \(p\)-recognizable sets of integers
• Semigroups, Presburger formulas, and languages
• Efficient Symbolic Representations for Arithmetic Constraints in Verification
• Diophantine equations, Presburger arithmetic and finite automata
• Unnamed Item
• Unnamed Item

This page was built for publication: The convex hull of a regular set of integer vectors is polyhedral and effectively computable