The convex hull of a regular set of integer vectors is polyhedral and effectively computable
From MaRDI portal
Publication:1044697
DOI10.1016/J.IPL.2005.04.004zbMATH Open1184.68634arXiv0812.1951OpenAlexW2123615615MaRDI QIDQ1044697FDOQ1044697
Authors: Alain Finkel, Jérôme Leroux
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Abstract: Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors represented by a NDD is proved to be an effectively computable convex polyhedron.
Full work available at URL: https://arxiv.org/abs/0812.1951
Recommendations
Cites Work
- Title not available (Why is that?)
- Semigroups, Presburger formulas, and languages
- Logic and \(p\)-recognizable sets of integers
- Title not available (Why is that?)
- Efficient Symbolic Representations for Arithmetic Constraints in Verification
- Diophantine equations, Presburger arithmetic and finite automata
Cited In (6)
Uses Software
This page was built for publication: The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044697)