12 citations · 18 across the 3 of their papers we have counts for
1 paper · 2 filters
Simon Beier, Markus Holzer, Martin Kutrib
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and…