@InProceedings{mithardnessgroup_et_al:LIPIcs.FUN.2024.25,
author = {MIT Hardness Group and Hendrickson, Della and Tockman, Andy},
title = {{Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants}},
booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-314-0},
ISSN = {1868-8969},
year = {2024},
volume = {291},
editor = {Broder, Andrei Z. and Tamir, Tami},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.25},
URN = {urn:nbn:de:0030-drops-199335},
doi = {10.4230/LIPIcs.FUN.2024.25},
annote = {Keywords: NP, coNP, hardness, minesweeper, solvability, gadgets, simulation}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode