{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:51:34Z","timestamp":1764132694283,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_42","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"435-447","source":"Crossref","is-referenced-by-count":5,"title":["Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants"],"prefix":"10.1007","author":[{"given":"Denys","family":"Duchier","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Durand-Lose","sequence":"additional","affiliation":[]},{"given":"Maxime","family":"Senot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"42_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1052796.1052804","volume":"36","author":"S. Aaronson","year":"2005","unstructured":"Aaronson, S.: NP-complete problems and physical reality. SIGACT News\u00a036(1), 30\u201352 (2005)","journal-title":"SIGACT News"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-60692-0_68","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"E. Asarin","year":"1995","unstructured":"Asarin, E., Maler, O.: Achilles and the Tortoise Climbing up the Arithmetical Hierarchy. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 471\u2013483. Springer, Heidelberg (1995)"},{"issue":"1","key":"42_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M. Cook","year":"2004","unstructured":"Cook, M.: Universality in elementary cellular automata. Compl. Syst.\u00a015(1), 1\u201340 (2004)","journal-title":"Compl. Syst."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem proving procedures. In: 3rd Symp. on Theory of Computing (STOC 1971), pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"42_CR5","unstructured":"Dean, J., Ghemawat, S.: Map\/Reduce: simplified data processing on large clusters. In: 6th Symp. on Operating Systems Design & Implementation (OSDI 2004). USENIX Association (2004)"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-17517-6_26","volume-title":"Algorithms and Computation","author":"D. Duchier","year":"2010","unstructured":"Duchier, D., Durand-Lose, J., Senot, M.: Fractal Parallelism: Solving SAT in Bounded Space and Time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol.\u00a06506, pp. 279\u2013290. Springer, Heidelberg (2010)"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Duchier, D., Durand-Lose, J., Senot, M.: Massively parallel automata in Euclidean space-time. In: IEEE 4th Int. Conf. on Self-Adaptive and Self-Organizing Systems Workshops (SASOW 2010), pp. 104\u2013109. IEEE Computer Society (2010)","DOI":"10.1109\/SASOW.2010.23"},{"key":"42_CR8","unstructured":"Duchier, D., Durand-Lose, J., Senot, M.: Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants (extended version). Arxiv preprint arXiv:1105.3454 (2011), http:\/\/arxiv.org\/abs\/1105.3454"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/11750321_61","volume-title":"Theory and Applications of Models of Computation","author":"J. Durand-Lose","year":"2006","unstructured":"Durand-Lose, J.: Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol.\u00a03959, pp. 644\u2013653. Springer, Heidelberg (2006)"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-03745-0_20","volume-title":"Unconventional Computation","author":"J. Durand-Lose","year":"2009","unstructured":"Durand-Lose, J.: Abstract Geometrical Computation and Computable Analysis. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds.) UC 2009. LNCS, vol.\u00a05715, pp. 158\u2013167. Springer, Heidelberg (2009)"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2010.07.013","volume":"412","author":"J. Durand-Lose","year":"2011","unstructured":"Durand-Lose, J.: Abstract geometrical computation 4: small Turing universal signal machines. Theoret. Comp. Sci.\u00a0412, 57\u201367 (2011)","journal-title":"Theoret. Comp. Sci."},{"issue":"3","key":"42_CR12","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"P. Fischer","year":"1965","unstructured":"Fischer, P.: Generation of primes by a one-dimensional real-time iterative array. Jour. ACM\u00a012(3), 388\u2013394 (1965)","journal-title":"Jour. ACM"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Goliaei, S., Jalili, S.: An optical solution to the 3-SAT problem using wavelength based selectors. The Journal of Supercomputing, 1\u201310 (2010)","DOI":"10.1007\/s11227-010-0494-z"},{"issue":"1","key":"42_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(89)90120-5","volume":"68","author":"U. Huckenbeck","year":"1989","unstructured":"Huckenbeck, U.: Euclidian geometry in terms of automata theory. Theoret. Comp. Sci.\u00a068(1), 71\u201387 (1989)","journal-title":"Theoret. Comp. Sci."},{"issue":"1","key":"42_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(90)90160-J","volume":"73","author":"G. Jacopini","year":"1990","unstructured":"Jacopini, G., Sontacchi, G.: Reversible parallel computation: an evolving space-model. Theoret. Comp. Sci.\u00a073(1), 1\u201346 (1990)","journal-title":"Theoret. Comp. Sci."},{"key":"42_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20877-5_24","volume-title":"Theory and Applications of Models of Computation","author":"E. Jeandel","year":"2011","unstructured":"Jeandel, E., Vanier, P.: $\\it \\Pi^0_1$ Sets and Tilings. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 230\u2013239. Springer, Heidelberg (2011)"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-13562-0_32","volume-title":"Theory and Applications of Models of Computation","author":"I. Mackie","year":"2010","unstructured":"Mackie, I.: A Visual Model of Computation. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 350\u2013360. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"42_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(99)00328-X","volume":"259","author":"M. Margenstern","year":"2001","unstructured":"Margenstern, M., Morita, K.: NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theoret. Comp. Sci.\u00a0259(1-2), 99\u2013128 (2001)","journal-title":"Theoret. Comp. Sci."},{"issue":"1-3","key":"42_CR19","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2004.07.001","volume":"334","author":"T. Naughton","year":"2005","unstructured":"Naughton, T., Woods, D.: An optical model of computation. Theoret. Comput. Sci.\u00a0334(1-3), 227\u2013258 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"42_CR20","first-page":"75","volume":"6","author":"G. P\u0103un","year":"2001","unstructured":"P\u0103un, G.: P-systems with active membranes: Attacking NP-Complete problems. Jour. of Automata, Languages and Combinatorics\u00a06(1), 75\u201390 (2001)","journal-title":"Jour. of Automata, Languages and Combinatorics"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: 5th ACM Symp. on Theory of Computing (STOC 1973), vol.\u00a016, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:49Z","timestamp":1743044089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}