{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:50Z","timestamp":1725664190667},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:00:43Z","timestamp":1330275643000},"page":"95-106","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A random NP-complete problem for inversion of 2D cellular automata"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","volume":"6","author":"S. Amoroso","year":"1972","unstructured":"S. Amoroso and Y.N. Patt. Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J. Comp. Syst. Sci., 6:448\u2013464, 1972.","journal-title":"J. Comp. Syst. Sci."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. In STOC, pages 204\u2013216, 1989.","DOI":"10.1145\/73007.73027"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"R. Berger. The undecidability of the domino problem. Memoirs of the American Mathematical Society, 66, 1966.","DOI":"10.1090\/memo\/0066"},{"issue":"5","key":"9_CR4","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1137\/0222059","volume":"22","author":"A. Blass","year":"1993","unstructured":"A. Blass and Y. Gurevich. Randomizing reductions of search problems. SIAM Journal on Computing, 22(5):949\u2013975, 1993.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR5","unstructured":"A. Blass and Y. Gurevich. Matrix transformation is complete for the average case. SIAM Journal on computing, (to appear)."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"B. Durand. Global properties of 2D cellular automata: some complexity results. In MFCS'93, Lecture Notes in Computer Science. Springer Verlag, September 1993.","DOI":"10.1007\/3-540-57182-5_35"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"B. Durand. Undecidability of the surjectivity problem for 2D cellular automata: A simplified proof. In FCT'93, Lecture Notes in Computer Science. Springer Verlag, August 1993.","DOI":"10.1007\/3-540-57163-9_16"},{"key":"9_CR8","unstructured":"B. Durand. Automates cellulaires: r\u00e9versibilit\u00e9 et complexit\u00e9. PhD thesis, Ecole Normale Sup\u00e9rieure de Lyon, 1994."},{"key":"9_CR9","unstructured":"B. Durand. Inversion of 2d cellular automata: some complexity results. Theoretical Computer Science, (to appear)."},{"key":"9_CR10","unstructured":"B. Durand. The surjectivity problem for 2D cellular automata. Journal of Computer and Systems Science, (to appear)."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Y. Gurevich. Complete and incomplete randomized NP problems. In FOCS, 1987.","DOI":"10.1109\/SFCS.1987.14"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","volume":"42","author":"Y. Gurevich","year":"1991","unstructured":"Y. Gurevich. Average case completeness. Journal of Computer and System Sciences, 42:346\u2013398, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR13","first-page":"379","volume":"D 45","author":"J. Kari","year":"1990","unstructured":"J. Kari. Reversability of 2D cellular automata is undecidable. Physica, D 45:379\u2013385, 1990.","journal-title":"Physica"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0022-0000(05)80025-X","volume":"48","author":"J. Kari","year":"1994","unstructured":"J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, 48:149\u2013182, 1994.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L. Levin","year":"1986","unstructured":"L. Levin. Average case complete problems. SIAM J. Comput, 15(1):285\u2013286, February 1986.","journal-title":"SIAM J. Comput"},{"key":"9_CR16","first-page":"13","volume":"14","author":"E.F. Moore","year":"1962","unstructured":"E.F. Moore. Machine models of self-reproduction. Proc. Symp. Apl. Math., 14:13\u201333, 1962.","journal-title":"Proc. Symp. Apl. Math."},{"key":"9_CR17","first-page":"685","volume":"14","author":"J. Myhill","year":"1963","unstructured":"J. Myhill. The converse to Moore's garden-of-eden theorem. Proc. Am. Math. Soc., 14:685\u2013686, 1963.","journal-title":"Proc. Am. Math. Soc."},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0022-0000(72)80009-6","volume":"6","author":"D. Richardson","year":"1972","unstructured":"D. Richardson. Tesselations with local transformations. Journal of Computer and System Sciences, 6:373\u2013388, 1972.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"R.M. Robinson","year":"1971","unstructured":"R.M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae, 12:177\u2013209, 1971.","journal-title":"Inventiones Mathematicae"},{"key":"9_CR20","first-page":"19","volume":"5","author":"K. Sutner","year":"1991","unstructured":"K. Sutner. De Bruijn graphs and linear cellular automata. Complex Systems, 5:19\u201330, 1991.","journal-title":"Complex Systems"},{"key":"9_CR21","first-page":"229","volume":"D 45","author":"T. Toffoli","year":"1990","unstructured":"T. Toffoli and N. Margolus. Invertible cellular automata: a review. Physica, D 45:229\u2013253, 1990.","journal-title":"Physica"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:23:09Z","timestamp":1558268589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}