@inproceedings{simon:LIPIcs:2018:8484,
Address = {Dagstuhl, Germany},
Annote = {Keywords: polynomial hierarchy, completeness, containment problem, linear sets},
Author = {Simon, Hans U.},
BookTitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
Editor = {Niedermeier, Rolf and Vall{\'e}e, Brigitte},
File = {On the Containment Problem for Linear Sets - LIPIcs-STACS-2018-55 - a - a - p.pdf},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
Pages = {55:1--55:12},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{On the Containment Problem for Linear Sets}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8484},
Volume = {96},
Year = {2018},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2018/8484},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.STACS.2018.55},
date-added = {2020-03-03 16:33:54 +0100},
date-modified = {2020-03-03 16:33:54 +0100},
urn = {urn:nbn:de:0030-drops-84842},
doi = {10.4230/LIPIcs.STACS.2018.55}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A