{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:49:18Z","timestamp":1725493758659},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752707"},{"type":"electronic","value":"9783540752714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75271-4_20","type":"book-chapter","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T09:16:25Z","timestamp":1193649385000},"page":"190-199","source":"Crossref","is-referenced-by-count":0,"title":["Finiteness Properties of Some Families of GP-Trees"],"prefix":"10.1007","author":[{"given":"C\u00e9sar L.","family":"Alonso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Luis","family":"Monta\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jcom.1999.0526","volume":"16","author":"M. Aldaz","year":"2000","unstructured":"Aldaz, M., Heintz, J., Matera, G., Monta\u00f1a, J.L., Pardo, L.M.: Time-space tradeoffs in algebraic complexity theory. Real computation and complexity (Schloss Dagstuhl, 1998). J. Complexity\u00a016(1), 2\u201349 (2000)","journal-title":"J. Complexity"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0055765","volume-title":"Mathematical Foundations of Computer Science 1998","author":"M. Aldaz","year":"1998","unstructured":"Aldaz, M., Heintz, J., Matera, G., Monta\u00f1a, J.L., Pardo, L.M.: Combinatorial hardness proofs for polynomial evaluation (extended abstract). In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 167\u2013175. Springer, Heidelberg (1998)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower Bounds for Algebraic Computation Trees STOC 1983, pp. 80\u201386 (1981)","DOI":"10.1145\/800061.808735"},{"key":"20_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and real computation.","author":"L. Blum","year":"1998","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer, New York (1998)"},{"key":"20_CR5","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation over the real numbers: NP completeness, recursive functions and universal machines [Bull. Amer. Math. Soc (N.S.) 21 (1989), no. 1, 1\u201346; MR0974426 (90a:68022)]. In: Workshop on Dynamical Systems (Trieste, 1988), pp. 23\u201352, Pitman Res. Notes Math. Ser. 221, Longman Sci. Tech., Harlow (1990)"},{"key":"20_CR6","unstructured":"Bochnak, J., Coste, M., Roy, M.-F.: G\u00e9om\u00e9trie alg\u00e9brique r\u00e9elle (French) [Real algebraic geometry] Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], vol. 12, pp. x+373. Springer-Verlag, Berlin (1987)"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-01-00923-5","volume":"39","author":"F. Cucker","year":"2001","unstructured":"Cucker, F., Smale, S.: On the Mathematical foundations of learning. Bulletin (New Series) Of the AMS\u00a039(1), 1\u20134 (2001)","journal-title":"Bulletin (New Series) Of the AMS"},{"issue":"6","key":"20_CR8","doi-asserted-by":"publisher","first-page":"805","DOI":"10.3166\/ria.20.805-827","volume":"20","author":"S. Gelly","year":"2006","unstructured":"Gelly, S., Teytaud, O., Bredeche, N., Schoenauer, M.: Universal Consistency and Bloat in GP. Revue d\u2019Intelligence Artificielle\u00a020(6), 805\u2013827 (2006)","journal-title":"Revue d\u2019Intelligence Artificielle"},{"key":"20_CR9","first-page":"131","volume":"18","author":"P. Goldberg","year":"1995","unstructured":"Goldberg, P., Jerrum, M.: Bounding the Vapnik-Chervonenkis dimension of concept classes parametrizes by real numbers. Machine Learning\u00a018, 131\u2013148 (1995)","journal-title":"Machine Learning"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-59119-2_189","volume-title":"Computational Learning Theory","author":"M. Karpinski","year":"1995","unstructured":"Karpinski, M., Macintyre, A.: Bounding VC-dimension for neural networks: progress and prospects. In: Vit\u00e1nyi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol.\u00a0904, pp. 337\u2013341. Springer, Heidelberg (1995)"},{"key":"20_CR11","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA (1992)"},{"key":"20_CR12","first-page":"5","volume-title":"Principles of nonparametric learning","author":"G. Lugosi","year":"2002","unstructured":"Lugosi, G.: Pattern clasification and learning theory. In: Gyorfi, L. (ed.) Principles of nonparametric learning, pp. 5\u201362. Springer, Viena (2002)"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0022-4049(93)90113-8","volume":"87","author":"J.L. Monta\u00f1a","year":"1993","unstructured":"Monta\u00f1a, J.L., Pardo, L.M., Ramanakoraisina, R.: An extension of Warren\u2019s lower bounds for approximations. J. Pure Appl. Algebra\u00a087(3), 251\u2013258 (1993)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01270397","volume":"4","author":"J.L. Monta\u00f1a","year":"1993","unstructured":"Monta\u00f1a, J.L., Pardo, L.M.: Lower bounds for arithmetic networks. Appl. Algebra Engrg. Comm. Comput.\u00a04(1), 1\u201324 (1993)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"20_CR15","volume-title":"Statistical learning theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical learning theory. John Willey & Sons, Chichester (1998)"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75271-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:57:53Z","timestamp":1619521073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75271-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752707","9783540752714"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75271-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}