First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
-
Updated
May 27, 2020 - C
#
isl
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the isl topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the isl topic, visit your repo's landing page and select "manage topics."