{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:16:24Z","timestamp":1725646584823},"publisher-location":"New York, NY","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387970196"},{"type":"electronic","value":"9781461396475"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/978-1-4613-9647-5_22","type":"book-chapter","created":{"date-parts":[[2011,12,27]],"date-time":"2011-12-27T03:00:25Z","timestamp":1324954825000},"page":"172-181","source":"Crossref","is-referenced-by-count":0,"title":["Why Integration is Hard"],"prefix":"10.1007","author":[{"given":"H. James","family":"Hoover","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Computable Analysis","author":"O Aberth","year":"1980","unstructured":"O. Aberth. Computable Analysis. 1980. McGraw-Hill."},{"key":"22_CR2","volume-title":"Foundations of Constructive Analysis","author":"E Bishop","year":"1967","unstructured":"E. Bishop. Foundations of Constructive Analysis. 1967. McGraw-Hill."},{"key":"22_CR3","volume-title":"On the complexity of familiar functions and numbers","author":"JM Borwein","year":"1986","unstructured":"J. M. Borwein and P. B. Borwein. On the complexity of familiar functions and numbers. Draft. Private Communication, 1986."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0001-8708(84)90019-7","volume":"53","author":"H Friedman","year":"1984","unstructured":"H. Friedman. The computational complexity of maximization and integration. Adv. in Math., 53, 1984, 80\u201398.","journal-title":"Adv. in Math."},{"key":"22_CR5","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0747-7171(87)80063-9","volume":"4","author":"J Gathen von zur","year":"1987","unstructured":"J. von zur Gathen. Feasible arithmetic computations: Valiant\u2019s hypothesis. J. Symb. Comp., 4, 1987, 137\u2013172.","journal-title":"J. Symb. Comp."},{"key":"22_CR7","first-page":"171","volume-title":"Boolean circuits versus arithmetic circuits","author":"J Gathen von zur","year":"1986","unstructured":"J. von zur Gathen and G. Seroussi. Boolean circuits versus arithmetic circuits. Proc. 6th Int. Conf. in Computer Science, Santiago, Chile. 1986, 171\u2013184."},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","volume":"44","author":"A Grzegorczyk","year":"1957","unstructured":"A. Grzegorczyk. On the definition of computable real continuous functions. Fund. Math., 44, 1957, 61\u201371.","journal-title":"Fund. Math."},{"key":"22_CR9","volume-title":"Feasibly constructive analysis","author":"HJ Hoover","year":"1987","unstructured":"H. J. Hoover. Feasibly constructive analysis. Ph.D. thesis and Technical Report 206\/87, Department of Computer Science, University of Toronto, 1987."},{"key":"22_CR10","volume-title":"Feasible real functions and arithmetic circuits","author":"HJ Hoover","year":"1988","unstructured":"H. J. Hoover. Feasible real functions and arithmetic circuits. Technical Report TR 88-16, August 1988, Department of Computing Science, University of Alberta, Edmonton, Canada."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K Ko","year":"1982","unstructured":"K. Ko and H. Friedman. Computational complexity of real functions. Theoret. Comput. Sci., 20, 1982, 323\u2013352.","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"22_CR12","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc. (2), 42, 1936\/37, 230\u2013265.","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"22_CR13","first-page":"544","volume":"43","author":"AM Turing","year":"1937","unstructured":"A. M. Turing. A correction. Proc. London Math. Soc. (2), 43, 1937, 544\u2013546.","journal-title":"Proc. London Math. Soc."}],"container-title":["Computers and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4613-9647-5_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T09:10:19Z","timestamp":1619860219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4613-9647-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9780387970196","9781461396475"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-1-4613-9647-5_22","relation":{},"subject":[],"published":{"date-parts":[[1989]]}}}