@InProceedings{simon:LIPIcs.STACS.2018.55,
  author =	{Simon, Hans U.},
  title =	{{On the Containment Problem for Linear Sets}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{55:1--55:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Niedermeier, Rolf and Vall\'{e}e, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.55},
  URN =		{urn:nbn:de:0030-drops-84842},
  doi =		{10.4230/LIPIcs.STACS.2018.55},
  annote =	{Keywords: polynomial hierarchy, completeness, containment problem, linear sets}
}