Simple and Efficient Algorithms for Octagons
From MaRDI portal
Publication:2789052
DOI10.1007/978-3-319-12736-1_16zbMath1453.68044OpenAlexW2164622183MaRDI QIDQ2789052
No author found.
Publication date: 26 February 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12736-1_16
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
Compact Difference Bound Matrices ⋮ Sparsity preserving algorithms for octagons ⋮ Incrementally closing octagons
This page was built for publication: Simple and Efficient Algorithms for Octagons