Conference icon

Conference

The taming of the semi-linear set

Abstract:

Semi-linear sets, which are rational subsets of the monoid (Z^d,+), have numerous applications in theoretical computer science. Although semi-linear sets are usually given implicitly, by formulas in Presburger arithmetic or by other means, the effect of Boolean operations on semi-linear sets in terms of the size of description has primarily been studied for explicit representations. In this paper, we develop a framework suitable for implicitly presented semi-linear sets, in which the size of ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.4230/LIPIcs.ICALP.2016.128

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Publisher:
Schloss Dagstuhl Publisher's website
Volume:
55
Pages:
128:1--128:13
Series:
Leibniz International Proceedings in Informatics
Publication date:
2016-08-17
Acceptance date:
2016-04-15
DOI:
ISSN:
1868-8969
Pubs id:
pubs:635015
URN:
uuid:7205ba8c-3a7f-44c3-80b5-54b8ecbda474
Source identifiers:
635015
Local pid:
pubs:635015
ISBN:
978-3-95977-013-2

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP