Binary Pattern Tile Set Synthesis Is NP-hard
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
Binary Pattern Tile Set Synthesis Is NP-hard
ICALP, 2015.

ICALP v1 2015
Full names Links ISxN
	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,


Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.