Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950026 | Electronic Notes in Theoretical Computer Science | 2017 | 14 Pages |
Abstract
Known algorithms for manipulating octagons do not preserve their sparsity, leading typically to quadratic or cubic time and space complexities even if no relation among variables is known when they are all bounded. In this paper, we present new algorithms, which use and return octagons represented as weakly closed difference bound matrices, preserve the sparsity of their input and have better performance in the case their inputs are sparse. We prove that these algorithms are as precise as the known ones.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jacques-Henri Jourdan,