Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
No abstract available.
Related papers
- Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear Programs with Convex Hull as the Intermediate Representation PLDI 2024
- GLORE: generalized loop redundancy elimination upon LER-notation OOPSLA 2017
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools VMCAI 2013
- Extended lattice-based memory allocation CC 2016
- A Logical Product Approach to Zonotope Intersection CAV 2010
- Optimizing Memory Accesses For Spatial Computation CGO 2003
- The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering POPL 1993
- Extending Constraint-Only Representation of Polyhedra with Boolean Constraints SAS 2018