Yuriy Brun. Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time. In Max H. Garzon, Hao Yan, editors, DNA Computing, 13th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers. Volume 4848 of Lecture Notes in Computer Science, pages 26-35, Springer, 2007. [doi]
@inproceedings{Brun07:0,
title = {Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time},
author = {Yuriy Brun},
year = {2007},
doi = {10.1007/978-3-540-77962-9_3},
url = {http://dx.doi.org/10.1007/978-3-540-77962-9_3},
tags = {completeness},
researchr = {https://researchr.org/publication/Brun07%3A0},
cites = {0},
citedby = {0},
pages = {26-35},
booktitle = {DNA Computing, 13th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers},
editor = {Max H. Garzon and Hao Yan},
volume = {4848},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-77961-2},
}