{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:27:47Z","timestamp":1773228467464,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540510833","type":"print"},{"value":"9783540461524","type":"electronic"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51083-4_54","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:40:05Z","timestamp":1330202405000},"page":"131-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Some new effectivity bounds in computational geometry"],"prefix":"10.1007","author":[{"given":"Leandro","family":"Caniglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Galligo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joos","family":"Heintz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","unstructured":"D. Bayer, M. Stillman: On the complexity of computing syzygies. Preprint 1985."},{"key":"12_CR2","unstructured":"C.A. Berenstein, A. Yger: Effective Bezout Identities in Q[z1, ... zn]. Preprint University of Maryland 1987."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S.J. Berkowitz","year":"1984","unstructured":"S.J. Berkowitz: On computing the determinant in small parallel time using a small number of processors. Information Processing Letters 18 (1984) 147\u2013150.","journal-title":"Information Processing Letters"},{"issue":"I","key":"12_CR4","first-page":"553","volume":"287","author":"J. Brian\u00e7on","year":"1982","unstructured":"J. Brian\u00e7on: Sur le degr\u00e9 des relations entre polyn\u00f4mes. C.R. Acad.Sci. Paris 287, S\u00e9rie I (1982) 553\u2013556.","journal-title":"C.R. Acad.Sci. Paris"},{"issue":"3","key":"12_CR5","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971361","volume":"126","author":"D. Brownawell","year":"1987","unstructured":"D. Brownawell: Bounds for the degrees in the Nullstellensatz. Ann.math. Second Series, Vol. 126 No 3 (1987) 577\u2013591.","journal-title":"Ann.math. Second Series"},{"issue":"I","key":"12_CR6","first-page":"287","volume":"305","author":"W.D. Brownawell","year":"1987","unstructured":"W.D. Brownawell: Borne effective pour l'exponent dans le th\u00e9or\u00e8me des z\u00e9ros. C.R. Acad.Sci. Paris 305, S\u00e9rie I (1987) 287\u2013290.","journal-title":"C.R. Acad.Sci. Paris"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"W.D. Brownawell: Local Diophantine Nullstellen Inequalities. Preprint Penn State University 1987.","DOI":"10.2307\/1990919"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/BF01844169","volume":"4","author":"B. Buchberger","year":"1970","unstructured":"B. Buchberger: Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleichungssystems. Aequat.math. 4 (1970) 374\u2013383.","journal-title":"Aequat.math."},{"key":"12_CR9","first-page":"3","volume":"72","author":"B. Buchberger","year":"1979","unstructured":"B. Buchberger: A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner bases. Sym. and Alg.Comp., Springer LN Comput.Sci. 72 (1979) 3\u201321.","journal-title":"Sym. and Alg.Comp., Springer LN Comput.Sci."},{"key":"12_CR10","first-page":"137","volume":"162","author":"B. Buchberger","year":"1983","unstructured":"B. Buchberger: A note on the complexity of constructing Gr\u00f6bner bases. Proc. Eurocal'83, Computer Algebra, ed. J.A. van Hulzen, Springer LN Comput.Sci. 162 (1983) 137\u2013145.","journal-title":"Springer LN Comput.Sci."},{"key":"12_CR11","unstructured":"L. Caniglia, A. Galligo, J. Heintz: Borne simple exponentielle pour les degr\u00e9s dans le th\u00e9or\u00e8me des z\u00e9ros sur un corps de caract\u00e9ristique quelconque. to appear in: C.R. Acad.Sci. Paris 1988."},{"key":"12_CR12","unstructured":"A.L. Chistov, D.Yu. Grigor'ev: Subexponential time solving systems of algebraic equations I,II. LOMI preprints E-9-83, E-10-83, Leningrad 1983."},{"key":"12_CR13","first-page":"17","volume":"176","author":"A.L. Chistov","year":"1984","unstructured":"A.L. Chistov, D.Yu. Grigor'ev: Complexity of quantifier elimination in the theory of algebraically closed fields. Proc. 11th Symp. MFCS 1984, Springer LN Comput.Sci. 176 (1984) 17\u201331.","journal-title":"Springer LN Comput.Sci."},{"key":"12_CR14","first-page":"63","volume":"199","author":"A.L. Chistov","year":"1985","unstructured":"A.L. Chistov: Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. Proc. Int.Conf. FCT 1985, Springer LN Comput.Sci. 199 (1985) 63\u201369.","journal-title":"Springer LN Comput.Sci."},{"key":"12_CR15","unstructured":"N. Fitchas, A. Galligo, J. Morgenstern: Algorithmes rapides en s\u00e9quentiel et en parallel pour l'\u00e9limination de quantificateurs en g\u00e9om\u00e9trie \u00e9l\u00e9mentaire. to appear in: S\u00e9minaire Structures Alg\u00e9briques Ordonn\u00e9es, UER de Math., Universit\u00e9 de Paris VII (1987); final version to appear in: Same Seminary, Publ.Univ. Paris VII."},{"key":"12_CR16","unstructured":"A. Galligo: Algorithmes de construction de bases standards. Preprint University of Nice 1985."},{"key":"12_CR17","unstructured":"A. Galligo, J. Heintz, J. Morgenstern: Parallelism and fast quantifier elimination over algebraically (and real) closed fields. Invited lecture Int.Conf. FCT'87 Kazan 1987."},{"key":"12_CR18","first-page":"159","volume":"174","author":"M. Giusti","year":"1984","unstructured":"M. Giusti: Some effectivity problems in polynomial ideal theory. Proc. Eurosam 84, Springer LN Comput.Sci. 174 (1984) 159\u2013171.","journal-title":"Springer LN Comput.Sci."},{"key":"12_CR19","unstructured":"M. Giusti: Complexity of standard bases in projective dimension zero. Preprint Ecole Polytechnique Paris 1987."},{"key":"12_CR20","unstructured":"M. Giusti: Combinatorial dimension theory of algebraic varieties. Preprint Ecole Polytechnique Paris 1988."},{"issue":"2","key":"12_CR21","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1070\/IM1987v029n02ABEH000979","volume":"29","author":"D. Grigor'ev","year":"1987","unstructured":"D.Yu. Grigor'ev: The complexity of the decision problem for the first order theory of algebraically closed fields. Math. USSR Izvestija, Vol. 29, No 2 (1987) 459\u2013475.","journal-title":"Math. USSR Izvestija"},{"key":"12_CR22","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(83)90002-6","volume":"24","author":"J. Heintz","year":"1983","unstructured":"J. Heintz: Definability and fast quantifier elimination in algebraically closed fields. Theoret.Comput.Sci. 24 (1983) 239\u2013277; Russian transl. in: Kyberneticeskij Sbornik, Novaja Serija Vyp. 22, Mir Moscow (1985) 113\u2013158.","journal-title":"Theoret.Comput.Sci."},{"issue":"4","key":"12_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1088322.1088324","volume":"9","author":"J. Heintz","year":"1975","unstructured":"J. Heintz, R. W\u00fcthrich: An efficient quantifier elimination algorithm for algebraically closed fields. SIGSAM Bull. 9(4) (1975) 11.","journal-title":"SIGSAM Bull."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"J. Koll\u00e1r: Sharp effective Nullstellensatz. Manuscript 1988.","DOI":"10.2307\/1990996"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"B. Iversen: Generic Local Structure in Commutative Algebra. Springer LN Math. 310 (1973).","DOI":"10.1007\/BFb0060790"},{"key":"12_CR26","unstructured":"J.P. Jouanolou: Th\u00e9or\u00e8mes de Bertini et applications. Birkh\u00e4user PM 42 (1983)."},{"key":"12_CR27","unstructured":"C. Kollreider, B. Buchberger: An improved algorithmic construction of Gr\u00f6bnerbases for polynomial ideals. Bericht Nr. 170 (1978), Technical Report, Universit\u00e4t Linz."},{"key":"12_CR28","doi-asserted-by":"crossref","first-page":"165","DOI":"10.24033\/bsmf.1848","volume":"105","author":"D. Lazard","year":"1977","unstructured":"D. Lazard: Alg\u00e8bre lin\u00e9aire sur K[X1, ..., Xn] et \u00e9limination. Bull.Soc.Math. France 105 (1977) 165\u2013190.","journal-title":"Bull.Soc.Math. France"},{"key":"12_CR29","first-page":"146","volume":"162","author":"D. Lazard","year":"1983","unstructured":"D. Lazard: Gr\u00f6bner Bases, Gaussian Elimination and Resolution of Algebraic Equations. Proc. Eurocal'83, Computer Algebra, ed. J.A. van Hulzen, Springer LN Comput.Sci. 162 (1983) 146\u2013156.","journal-title":"Springer LN Comput.Sci."},{"key":"12_CR30","unstructured":"H. Matsumura: Commutative algebra. W.A. Benjamin 1980 (first edition)."},{"key":"12_CR31","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E. Mayr","year":"1982","unstructured":"E. Mayr, A. Meyer: The complexity of the word problem for commutative semigroups and polynomial ideals. Advances in Math. 46 (1982) 305\u2013329.","journal-title":"Advances in Math."},{"issue":"1","key":"12_CR32","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0021-8693(86)90071-2","volume":"100","author":"H.M. M\u00f6ller","year":"1986","unstructured":"H.M. M\u00f6ller, F. Mora: New Constructive Methods in Classical Ideal Theory. J. of Algebra, Vol. 100, No 1 (1986) 138\u2013178.","journal-title":"J. of Algebra"},{"key":"12_CR33","unstructured":"K. Mulmuley: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Proc. 18th Ann. ACM Symp. Theory of Computing (1986) 338\u2013339."},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"I.R. Shafarevich: Algebraic Geometry. Springer Berlin 1974.","DOI":"10.1007\/978-3-642-96200-4"},{"key":"12_CR35","unstructured":"B. Shiffman: New degree bounds for the Nullstellensatz in arbitrary characteristic. Manuscript 1988."},{"issue":"1\u20132","key":"12_CR36","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0747-7171(88)80003-8","volume":"5","author":"V. Weispfenning","year":"1988","unstructured":"V. Weispfenning: The complexity of linear problems in fields. J. on symbolic Comput. Vol. 5, No. 1\u20132 (1988) 3\u201327.","journal-title":"J. on symbolic Comput."},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"R. W\u00fcthrich: Ein schnelles Quantoreneliminationsverfahren f\u00fcr die Theorie der algebraisch abgeschlossenen K\u00f6rper. Ph.D.-Thesis, Univ. Zurich 1977.","DOI":"10.1007\/3-540-07805-3_10"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51083-4_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:15:19Z","timestamp":1558268119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51083-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510833","9783540461524"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-51083-4_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}