Pages that link to "Item:Q2576576"
From MaRDI portal
The following pages link to Not necessarily closed convex polyhedra and the double description method (Q2576576):
Displaying 13 items.
- Efficient constraint/generator removal from double description of polyhedra (Q281283) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Tracking smooth trajectories in linear hybrid systems (Q1680510) (← links)
- On the efficiency of convex polyhedra (Q2130564) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- On finite linear systems containing strict inequalities (Q2401512) (← links)
- A Note on the Inversion Join for Polyhedral Analysis (Q2814111) (← links)
- Speeding up Polyhedral Analysis by Identifying Common Constraints (Q2814112) (← links)
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- Cost Problems for Parametric Time Petri Nets* (Q5025060) (← links)
