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

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]

Authors

Yuriy Brun

This author has not been identified. Look up 'Yuriy Brun' in Google