Pages that link to "Item:Q5452703"

The following pages link to An Improved Tight Closure Algorithm for Integer Octagonal Constraints (Q5452703):

Displaying 8 items.

• A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
• Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
• A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
• Algorithms for tight spans and tropical linear spaces (Q1994124) (← links)
• Certified abstract cost analysis (Q2044174) (← links)
• Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
• Incrementally closing octagons (Q2335904) (← links)