{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:51:39Z","timestamp":1725576699114},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183041"},{"type":"electronic","value":"9783642183058"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18305-8_1","type":"book-chapter","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T06:58:40Z","timestamp":1295593120000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["Improving Efficiency of 3-SAT-Solving Tile Systems"],"prefix":"10.1007","author":[{"given":"Yuriy","family":"Brun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"1_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/332833.332842","volume":"43","author":"H. Abelson","year":"2000","unstructured":"Abelson, H., Allen, D., Coore, D., Hanson, C., Homsy, G., Knight Jr., T.F., Nagpal, R., Rauch, E., Sussman, G.J., Weiss, R.: Amorphous computing. Communications of the ACM\u00a043(5), 74\u201382 (2000)","journal-title":"Communications of the ACM"},{"key":"1_CR2","unstructured":"Adleman, L.: Towards a mathematical theory of self-assembly. Tech. Rep. 00-722, Department of Computer Science, University of Southern California, Los Angeles, CA (2000)"},{"issue":"12","key":"1_CR3","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.1021\/nl052038l","volume":"5","author":"R. Barish","year":"2005","unstructured":"Barish, R., Rothemund, P.W.K., Winfree, E.: Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters\u00a05(12), 2586\u20132592 (2005)","journal-title":"Nano Letters"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2006.10.025","volume":"378","author":"Y. Brun","year":"2007","unstructured":"Brun, Y.: Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science\u00a0378(1), 17\u201331 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2007.07.051","volume":"395","author":"Y. Brun","year":"2008","unstructured":"Brun, Y.: Nondeterministic polynomial time factoring in the tile assembly model. Theoretical Computer Science\u00a0395(1), 3\u201323 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2007.07.052","volume":"395","author":"Y. Brun","year":"2008","unstructured":"Brun, Y.: Solving NP-complete problems in the tile assembly model. Theoretical Computer Science\u00a0395(1), 31\u201346 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jalgor.2008.07.002","volume":"63","author":"Y. Brun","year":"2008","unstructured":"Brun, Y.: Solving satisfiability in the tile assembly model with a constant-size tileset. Journal of Algorithms\u00a063(4), 151\u2013166 (2008)","journal-title":"Journal of Algorithms"},{"key":"1_CR8","unstructured":"Brun, Y., Medvidovic, N.: Preserving privacy in distributed computation via self-assembly. Tech. Rep. USC-CSSE-2008-819, Center for Software Engineering, University of Southern California (2008)"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1090\/dimacs\/035\/06","volume":"35","author":"O. Kullmann","year":"1997","unstructured":"Kullmann, O.: Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a035, 261\u2013313 (1997)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00017-6","volume":"223","author":"O. Kullmann","year":"1999","unstructured":"Kullmann, O.: New methods for 3-SAT decisions and worst-case analysis. Theoretical Computer Science\u00a0223, 1\u201372 (1999)","journal-title":"Theoretical Computer Science"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1090\/dimacs\/054\/12","volume":"54","author":"M.G. Lagoudakis","year":"1999","unstructured":"Lagoudakis, M.G., LaBean, T.H.: 2D DNA self-assembly for satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a054, 141\u2013154 (1999)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"1_CR12","unstructured":"McLurkin, J., Smith, J., Frankel, J., Sotkowitz, D., Blau, D., Schmidt, B.: Speaking swarmish: Human-robot interface design for large swarms of autonomous mobile robots. In: Proceedings of the AAAI Spring Symposium, Stanford, CA, USA (March 2006)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","volume":"10","author":"B. Monien","year":"1985","unstructured":"Monien, B., Speckenmeyer, E.: Solving satisfiability in less than 2 n steps. Discrete Applied Mathematics\u00a010(3), 287\u2013296 (1985)","journal-title":"Discrete Applied Mathematics"},{"issue":"12","key":"1_CR14","doi-asserted-by":"crossref","first-page":"e424","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"Paul W. K Rothemund","year":"2004","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology 2(12), e424 (2004)","journal-title":"PLoS Biology"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), Portland, OR, USA, May 2000, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-56992-8_22","volume":"702","author":"I. Schiermeyer","year":"1993","unstructured":"Schiermeyer, I.: Solving 3-satisfiability in less than 1.579 n steps. Computer Science Logic\u00a0702, 379\u2013394 (1993)","journal-title":"Computer Science Logic"},{"issue":"6","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D. Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal on Computing\u00a036(6), 1544\u20131569 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition. II. Bell System Technical Journal\u00a040, 1\u201342 (1961)","journal-title":"II. Bell System Technical Journal"},{"key":"1_CR19","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology, Pasadena, CA, USA (June 1998)"},{"key":"1_CR20","unstructured":"Winfree, E.: Simulations of computing by self-assembly of DNA. Tech. Rep. CS-TR:1998:22, California Institute of Technology, Pasadena, CA, USA (1998)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: a survey. Combinatorial Optimization - Eureka, You Shrink! pp. 185\u2013207 (2003)","DOI":"10.1007\/3-540-36478-1_17"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18305-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T01:22:00Z","timestamp":1559956920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18305-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183041","9783642183058"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18305-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}