Binary pattern tile set synthesis is NP-hard

DOI10.1007/978-3-662-47672-7_83MaRDI QIDQ6826799zbMATH OpenFDO

Authors Lila Kari, Steffen Kopecki, Pierre Meunier, Matthew J. Patitz, Shinnosuke Seki

Publication date 27 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-47672-7_83

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cellular automata (computational aspects) (68Q80)

This page was built for publication: Binary pattern tile set synthesis is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826799)