Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
Binary Pattern Tile Set Synthesis Is NP-hard
ICALP, 2015.
@inproceedings{ICALP-v1-2015-KariKMPS,
author = "Lila Kari and Steffen Kopecki and Pierre-Étienne Meunier and Matthew J. Patitz and Shinnosuke Seki",
booktitle = "{Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Part I}",
doi = "10.1007/978-3-662-47672-7_83",
isbn = "978-3-662-47671-0",
pages = "1022--1034",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Binary Pattern Tile Set Synthesis Is NP-hard}",
volume = 9134,
year = 2015,
}
Tags: