{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:58:22Z","timestamp":1725544702546},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341611"},{"type":"electronic","value":"9783540341659"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11753681_6","type":"book-chapter","created":{"date-parts":[[2006,7,28]],"date-time":"2006-07-28T02:31:54Z","timestamp":1154053914000},"page":"67-80","source":"Crossref","is-referenced-by-count":1,"title":["An Algorithm for SAT Without an Extraction Phase"],"prefix":"10.1007","author":[{"given":"Pierluigi","family":"Frisco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christiaan","family":"Henkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szabolcs","family":"Tengely","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: On constructing a molecular computer. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a027, pp. 1\u201322. American Mathematical Society (1995)","DOI":"10.1090\/dimacs\/027\/01"},{"issue":"3","key":"6_CR3","first-page":"343","volume":"1","author":"J. Bae","year":"2002","unstructured":"Bae, J.: On generalized subset-sum-distinct sequences. Int. J. Pure Appl. Math.\u00a01(3), 343\u2013352 (2002)","journal-title":"Int. J. Pure Appl. Math."},{"issue":"5567","key":"6_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1126\/science.1069528","volume":"296","author":"R.S. Braich","year":"2002","unstructured":"Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.: Solution to a 20-variable 3-SAT problem on a DNA computer. Science\u00a0296(5567), 499\u2013502 (2002)","journal-title":"Science"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A. Brauer","year":"1942","unstructured":"Brauer, A.: On a problem of partitions. Amer. J. Math.\u00a064, 299\u2013312 (1942)","journal-title":"Amer. J. Math."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"13690","DOI":"10.1073\/pnas.97.4.1385","volume":"97","author":"D. Faulhammer","year":"2000","unstructured":"Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular computation: RNA solutions to chess problems. Proc. Nat. Acad. Sci. USA\u00a097, 13690\u201313695 (2000)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"6_CR7","unstructured":"Frisco, P., Tengely, S.: On unique-sum sets (manuscript in preparation, 2005)"},{"key":"6_CR8","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co, San Francisco (1979)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0303-2647(99)00041-6","volume":"52","author":"N. Jonoska","year":"1999","unstructured":"Jonoska, N., Karl, S.A., Saito, M.: Three dimensional DNA structures in computing. BioSystems\u00a052, 243\u2013253 (1999)","journal-title":"BioSystems"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48017-X_21","volume-title":"DNA Computing","author":"Y. Khodor","year":"2002","unstructured":"Khodor, Y., Khodor, J., Knight Jr., T.F.: Experimental conformation of the basic principles of length-only discrimination. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol.\u00a02340, p. 223. Springer, Heidelberg (2002)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R.J. Lipton","year":"1995","unstructured":"Lipton, R.J.: Using DNA to solve NP-complete problems. Science\u00a0268, 542\u2013545 (1995)","journal-title":"Science"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Liu, Q., Wang, L., Frutos, A.G., Condon, A.E., Corn, R.M., Smith, L.M.: DNA computing on surfaces. Nature\u00a0403 (2000)","DOI":"10.1038\/35003155"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48017-X_16","volume-title":"DNA Computing","author":"V. Manca","year":"2002","unstructured":"Manca, V., Zandron, C.: A DNA algorithm for 3-SAT(11,20). In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol.\u00a02340. Springer, Heidelberg (2002)"},{"key":"6_CR14","volume-title":"Computational complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley Pub. Co., Reading (1994)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2309555","volume":"63","author":"G. P\u00f3lya","year":"1956","unstructured":"P\u00f3lya, G.: On picture-writing. Amer. Math. Monthly\u00a063, 689\u2013697 (1956)","journal-title":"Amer. Math. Monthly"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"K. Sakamoto","year":"2000","unstructured":"Sakamoto, K., Gounzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science\u00a0288, 1223\u20131226 (2000)","journal-title":"Science"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"4962","DOI":"10.1093\/nar\/gkh817","volume":"32","author":"K.A. Schmidt","year":"2004","unstructured":"Schmidt, K.A., Henkel, C.V., Rozenberg, G., Spaink, H.P.: DNA computing using single-molecule hybridization detection. Nucleic acid research\u00a032, 4962\u20134968 (2004)","journal-title":"Nucleic acid research"},{"issue":"7","key":"6_CR18","doi-asserted-by":"publisher","first-page":"562","DOI":"10.2307\/2320864","volume":"85","author":"H.S. Wilf","year":"1978","unstructured":"Wilf, H.S.: A circle-of-lights algorithm for the money-changing problem. Amer. Math. Monthly\u00a085(7), 562\u2013565 (1978)","journal-title":"Amer. Math. Monthly"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45711-9_23","volume-title":"Formal and Natural Computing","author":"T. Yokomori","year":"2002","unstructured":"Yokomori, T., Sakakibara, Y., Kobayashi, S.: A magic pot: Self-assembly computation revisited. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 418\u2013429. Springer, Heidelberg (2002)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Yoshida, H., Suyama, A.: Solution to 3-SAT by breadth first search. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a054, pp. 9\u201322. American Mathematical Society (1999)","DOI":"10.1090\/dimacs\/054\/02"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753681_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T05:17:47Z","timestamp":1555737467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753681_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341611","9783540341659"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11753681_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}