{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T19:26:09Z","timestamp":1655148369498},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0020-0190(01)00197-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"65-69","source":"Crossref","is-referenced-by-count":1,"title":["Transfer theorems via sign conditions"],"prefix":"10.1016","volume":"81","author":[{"given":"Pascal","family":"Koiran","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00197-1_BIB001","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"issue":"6","key":"10.1016\/S0020-0190(01)00197-1_BIB002","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1145\/235809.235813","article-title":"On the combinatorial and algebraic complexity of quantifier elimination","volume":"43","author":"Basu","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB003","series-title":"Complexity and Real Computation","author":"Blum","year":"1998"},{"issue":"1","key":"10.1016\/S0020-0190(01)00197-1_BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"issue":"4","key":"10.1016\/S0020-0190(01)00197-1_BIB005","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik\u2013Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(01)00197-1_BIB006","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/S0097539794270340","article-title":"On the power of real Turing machines with binary inputs","volume":"26","author":"Cucker","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00197-1_BIB007","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jcom.1995.1018","article-title":"Computing over the reals with addition and order: Higher complexity classes","volume":"11","author":"Cucker","year":"1995","journal-title":"J. Complexity"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-4049(90)90159-F","article-title":"Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields","volume":"67","author":"Fichtas","year":"1990","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB009","series-title":"Lower bounds are not easier over the reals: Inside PH, LIP Research Report 99-21","author":"Fournier","year":"1999"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB010","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(83)90002-6","article-title":"Definability and fast quantifier elimination over algebraically closed fields","volume":"24","author":"Heintz","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00197-1_BIB011","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1006\/jcss.1997.1477","article-title":"Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks","volume":"54","author":"Karpinski","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00197-1_BIB012","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jcss.1997.1478","article-title":"A weak version of the Blum, Shub & Smale model","volume":"54","author":"Koiran","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00197-1_BIB013","series-title":"Proc. STACS 2000","first-page":"35","article-title":"Circuits versus trees in algebraic complexity","volume":"1770","author":"Koiran","year":"2000"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB014","series-title":"Algebra","author":"Lang","year":"1993"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB015","series-title":"Ergodic Theory and Differentiable Dynamics","author":"Ma\u00f1\u00e9","year":"1987"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB016","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0885-064X(92)90007-X","article-title":"A note on a P\u2260NP result for a restricted class of real machines","volume":"8","author":"Meer","year":"1992","journal-title":"J. Complexity"},{"key":"10.1016\/S0020-0190(01)00197-1_BIB017","series-title":"Les Petits Cailloux","volume":"3","author":"Poizat","year":"1995"},{"issue":"3","key":"10.1016\/S0020-0190(01)00197-1_BIB018","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","article-title":"On the computational complexity and geometry of the first-order theory of the reals. Part I","volume":"13","author":"Renegar","year":"1992","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0020-0190(01)00197-1_BIB019","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0022-0000(92)90039-L","article-title":"Feedforward nets for interpolation and classification","volume":"45","author":"Sontag","year":"1992","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001971?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001971?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T09:20:44Z","timestamp":1556875244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0020019001001971"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00197-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}