{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:00:51Z","timestamp":1725858051812},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_8","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T15:34:07Z","timestamp":1465832047000},"page":"78-88","source":"Crossref","is-referenced-by-count":3,"title":["Squeezing Feasibility"],"prefix":"10.1007","author":[{"given":"Walter","family":"Dean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. University Press, Cambridge (2009)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bertoni, A., Mauri, G., Sabadini, N.: Simulations among classes of random access machines and equivalence among numbers succinctly represented. In: Annals of Discrete Mathematics. North-Holland Mathematics Studies, vol. 109, pp. 65\u201389. Elsevier (1985)","DOI":"10.1016\/S0304-0208(08)73103-7"},{"key":"8_CR3","volume-title":"Bounded Arithmetic","author":"R Buss","year":"1986","unstructured":"Buss, R.: Bounded Arithmetic. Bibliopolis, Naples (1986)"},{"key":"8_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04943-3","volume-title":"Boolean Functions and Computation Models","author":"P Clote","year":"2002","unstructured":"Clote, P.: Boolean Functions and Computation Models. Springer, Heidelberg (2002)"},{"key":"8_CR5","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Proceedings of the Third International Congress for Logic, Methodology and Philosophy of Science, Amsterdam, pp. 24\u201330. North-Holland (1965)"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/358141.358144","volume":"26","author":"S Cook","year":"1983","unstructured":"Cook, S.: An overview of computational complexity. Commun. ACM 26, 401\u2013408 (1983)","journal-title":"Commun. ACM"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","volume":"142","author":"S Cook","year":"1969","unstructured":"Cook, S., Aanderaa, S.: On the minimum computation time of functions. Trans. Am. Math. Soc. 142, 291\u2013314 (1969)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"8_CR8","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S Cook","year":"1973","unstructured":"Cook, S., Reckhow, R.: Time bounded random access machines. J. Comput. Syst. Sci. 7(4), 354\u2013375 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR9","unstructured":"Dean, W.: Computational complexity theory. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Fall 2015 Ed. (2015)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1137\/070711761","volume":"39","author":"M F\u00fcrer","year":"2009","unstructured":"F\u00fcrer, M.: Faster integer multiplication. SIAM J. Comput. 39(3), 979\u20131005 (2009)","journal-title":"SIAM J. Comput."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0049-237X(08)71257-6","volume-title":"The Kleene Symposium","author":"R Gandy","year":"1980","unstructured":"Gandy, R.: Church\u2019s thesis and principles for mechanisms. In: Barwise, H.K.J., Kunen, K. (eds.) The Kleene Symposium, vol. 101, pp. 123\u2013148. North Holland, Amsterdam (1980)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Simon, J.: On the power of multiplication in random access machines. In: 1974 IEEE Conference Record of 15th Annual Symposium on Switching and Automata Theory, pp. 13\u201323. IEEE (1974)","DOI":"10.1109\/SWAT.1974.20"},{"issue":"5","key":"8_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117(5), 285\u2013306 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"8_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)"},{"key":"8_CR15","unstructured":"Knuth, D.: The Art of Computer Programming, vol. I\u2013III. Addison Wesley, Boston (1973)"},{"issue":"4","key":"8_CR16","first-page":"3","volume":"13","author":"A Kolmogorov","year":"1958","unstructured":"Kolmogorov, A., Uspensky, V.: To the definition of algorithms. Uspekhi Mat. Nauk 13(4), 3\u201328 (1958)","journal-title":"Uspekhi Mat. Nauk"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Kreisel, G.: Informal rigour and completeness proofs. In: Problems in the Philosophy of Mathematics, pp. 138\u2013186 (1967)","DOI":"10.1016\/S0049-237X(08)71525-8"},{"issue":"2","key":"8_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.2307\/2272975","volume":"37","author":"G Kreisel","year":"1972","unstructured":"Kreisel, G.: Which number theoretic problems can be solved in recursive progressions on $$\\Pi ^1_1$$ \u03a0 1 1 -paths through $$\\cal {O}$$ O ? J. Symbolic Logic 37(2), 311\u2013334 (1972)","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"8_CR19","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1305\/ndjfl\/1093637646","volume":"28","author":"G Kreisel","year":"1987","unstructured":"Kreisel, G.: Church\u2019s thesis and the ideal of informal rigour. Notre Dame J. Formal Logic 28(4), 499\u2013519 (1987)","journal-title":"Notre Dame J. Formal Logic"},{"key":"8_CR20","volume-title":"Subrecursion: Functions and Hierarchies","author":"H Rose","year":"1984","unstructured":"Rose, H.: Subrecursion: Functions and Hierarchies. Clarendon Press, Oxford (1984)"},{"issue":"1","key":"8_CR21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/322108.322119","volume":"26","author":"W Savitch","year":"1979","unstructured":"Savitch, W., Stimson, M.: Time bounded random access machines with parallel processing. J. ACM 26(1), 103\u2013118 (1979)","journal-title":"J. ACM"},{"issue":"3","key":"8_CR22","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A.: Storage modification machines. SIAM J. Comput. 9(3), 490\u2013508 (1980)","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"8_CR23","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing 7(3\u20134), 281\u2013292 (1971)","journal-title":"Computing"},{"key":"8_CR24","first-page":"549","volume-title":"Philosophy of Mathematics, Handbook of the Philosophy of Science","author":"W Sieg","year":"2009","unstructured":"Sieg, W.: On computability. In: Irvine, A. (ed.) Philosophy of Mathematics, Handbook of the Philosophy of Science, vol. 4, pp. 549\u2013630. North Holland, Amsterdam (2009)"},{"issue":"2","key":"8_CR25","first-page":"230","volume":"42","author":"A Turing","year":"1936","unstructured":"Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42(2), 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"2","key":"8_CR26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(89)90117-8","volume":"30","author":"P Emde Boas van","year":"1989","unstructured":"van Emde Boas, P.: Space measures for storage modification machines. Inf. Process. Lett. 30(2), 103\u2013110 (1989)","journal-title":"Inf. Process. Lett."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: Machine models and simulations. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science (vol. A): Algorithms and Complexity. MIT Press, Cambridge (1990)","DOI":"10.1016\/B978-0-444-88071-0.50006-0"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T17:45:07Z","timestamp":1568051107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}