{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:33:34Z","timestamp":1725820414455},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_9","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"87-98","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems"],"prefix":"10.1007","author":[{"given":"Mitsunori","family":"Ogihara","sequence":"first","affiliation":[]},{"given":"Kei","family":"Uchizawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"2\u20133","key":"9_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0096-3003(98)10114-5","volume":"107","author":"CL Barrett","year":"2000","unstructured":"Barrett, C.L., Mortveit, H.S., Reidys, C.M.: Elements of a theory of simulation II: sequential dynamical systems. Appl. Math. Comput. 107(2\u20133), 121\u2013136 (2000)","journal-title":"Appl. Math. Comput."},{"issue":"8","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1016\/j.jcss.2006.03.006","volume":"72","author":"CL Barrett","year":"2006","unstructured":"Barrett, C.L., Hunt III, H.B., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: Complexity of reachability problems for finite discrete dynamical systems. J. Comput. Syst. Sci. 72(8), 1317\u20131345 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Barrett, C.L., Hunt III, H.B., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E., To\u0161i\u0107, P.T.: Gardens of eden and fixed points in sequential dynamical systems. In: Proceedings of Discrete Models: Combinatorics, Computation, and Geometry, pp. 95\u2013110 (2001)","DOI":"10.46298\/dmtcs.2294"},{"key":"9_CR4","unstructured":"Fellows, M.R., Koblitz, N.: Self-witnessing polynomial-time complexity and prime factorization. In: Proceedings of the Seventh Annual Conference on Structure in Complexity Theory, pp.107\u2013110 (1992)"},{"key":"9_CR5","unstructured":"Flor\u00e9en, P., Orponen, P.: Complexity issues in discrete Hopfield networks. Neuro-COLT Technical report Series, NC-TR-94-009 (1994)"},{"volume-title":"A Complexity Theory Companion","year":"2001","author":"LA Hemaspaandra","key":"9_CR6","unstructured":"Hemaspaandra, L.A., Ogihara, M.: A Complexity Theory Companion. Springer, Berlin (2001)"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s11786-007-0038-y","volume":"1","author":"S Kosub","year":"2008","unstructured":"Kosub, S.: Dichotomy results for fixed-point existence problems for boolean dynamical systems. Math. Comput. Sci. 1(3), 487\u2013505 (2008)","journal-title":"Math. Comput. Sci."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/aama.2000.0717","volume":"26","author":"R Laubenbacher","year":"2001","unstructured":"Laubenbacher, R., Pareigis, B.: Equivalence relations on finite dynamical systems. Adv. Appl. Math. 26(3), 237\u2013251 (2001)","journal-title":"Adv. Appl. Math."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kosub, S., Homan, C.M.: Dichotomy results for fixed point counting in boolean dynamical systems. In: Proceedings of the Tenth Italian Conference on Theoretical Computer Science (ICTCS 2007), pp. 163\u2013174 (2007)","DOI":"10.1142\/9789812770998_0018"},{"key":"9_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1836.001.0001","volume-title":"Circuit Complexity and Neural Networks","author":"I Parberry","year":"1994","unstructured":"Parberry, I.: Circuit Complexity and Neural Networks. MIT Press, Cambridge (1994)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:23:01Z","timestamp":1676445781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}