Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time

DOI10.1007/978-3-540-77962-9_3zbMATH Open1137.68375OpenAlexW1514329432MaRDI QIDQ5452688

Yuriy Brun

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77962-9_3

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (2)

Title not available (Why is that?) ⋮ Binary pattern tile set synthesis is NP-hard

This page was built for publication: Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time

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