Efficient Elimination of Redundancies in Polyhedra by Raytracing
No abstract available.
Related papers
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints TACAS 2009
- Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates CAV 2003
- Redundant Array Computation Elimination PLDI 2026
- Partial redundancy elimination in SSA form TOPLAS 1999
- Scanning Polyhedra with DO Loops PPoPP 1991
- Optimal and Efficient Speculation-Based Partial Redundancy Elimination CGO 2003
- An Efficient Abstract Domain for Not Necessarily Closed Polyhedra SAS 2018
- Eliminating Redundancy: Ultra-compact Code Generation for Programmable Dataflow Accelerators CGO 2026