On the efficiency of convex polyhedra
From MaRDI portal
Publication:2130564
DOI10.1016/j.entcs.2018.03.004OpenAlexW2797788337WikidataQ113317576 ScholiaQ113317576MaRDI QIDQ2130564
Publication date: 25 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2018.03.004
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient constraint/generator removal from double description of polyhedra
- The octahedron abstract domain
- Not necessarily closed convex polyhedra and the double description method
- Relational Abstract Domain of Weighted Hexagons
- A Note on the Inversion Join for Polyhedral Analysis
- Two Variables per Linear Inequality as an Abstract Domain
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Logahedra: A New Weakly Relational Domain
- The Abstract Domain of Parallelotopes
- Fast polyhedra abstract domain
- Algorithm for discovering the set of all the solutions of a linear programming problem
- Hybrid Systems: Computation and Control
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- Convexity recognition of the union of polyhedra
This page was built for publication: On the efficiency of convex polyhedra