Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, and Patrick A. Phillips. Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 57:1-57:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hemaspaandra_et_al:LIPIcs.MFCS.2022.57, author = {Hemaspaandra, Lane A. and Juvekar, Mandar and Nadjimzadah, Arian and Phillips, Patrick A.}, title = {{Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {57:1--57:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.57}, URN = {urn:nbn:de:0030-drops-168552}, doi = {10.4230/LIPIcs.MFCS.2022.57}, annote = {Keywords: structural complexity theory, computational complexity theory, ambiguity-limited NP, counting classes, P-printable sets} }
Feedback for Dagstuhl Publishing