{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T21:28:17Z","timestamp":1768771697636,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01200406","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:08:35Z","timestamp":1108728515000},"page":"31-55","source":"Crossref","is-referenced-by-count":22,"title":["Algorithmic aspects of Suslin's proof of Serre's conjecture"],"prefix":"10.1007","volume":"3","author":[{"given":"Leandro","family":"Caniglia","sequence":"first","affiliation":[]},{"given":"Guillermo","family":"Corti\ufffdas","sequence":"additional","affiliation":[]},{"given":"Silvia","family":"Dan\ufffdn","sequence":"additional","affiliation":[]},{"given":"Joos","family":"Heintz","sequence":"additional","affiliation":[]},{"given":"Teresa","family":"Krick","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Solern\ufffd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0747-7171(88)80039-7","volume":"6","author":"D. Bayer","year":"1988","unstructured":"D. Bayer andM. Stillman, On the complexity of computing syzygies,J. Symbolic Comp. 6 (1988), 135?147.","journal-title":"J. Symbolic Comp."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. Berkowitz","year":"1984","unstructured":"S. Berkowitz, On computing the determinant in small parallel time using a small number of processors,Inform. Processing Letters 18 (1984), 147?150.","journal-title":"Inform. Processing Letters"},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971361","volume":"126","author":"W. D. Brownawell","year":"1987","unstructured":"W. D. Brownawell, Bounds for the degree in the Nullstellensatz,Ann. Math. (Second Series)126 (3) (1987), 577?591.","journal-title":"Ann. Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-94-009-5225-6_6","volume-title":"Multidimensional Systems Theory","author":"B. Buchberger","year":"1985","unstructured":"B. Buchberger, Gr\u00f6bner-Bases: an algorithmic method in polynomial ideal theory, inMultidimensional Systems Theory, N. K. Bose, ed., Reidel Publishing Company, Dordrecht, 1985, 184?232."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"L. Caniglia, A. Galligo, and J. Heintz, Some new effectivity bounds in computational geometry, inProc. 6-th Int. Conf. Applied Algebra, Algebraic Algorithmic and Error Correcting Codes (AAECC-6), T. Mora, ed., Springer LN Comp. Sci.357 (1989), 131?151.","DOI":"10.1007\/3-540-51083-4_54"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"L. Caniglia, J. A. Guccione, and J. J. Guccione, Local Membership Problems for Polynomial Ideals, inEffective Methods in Algebraic Geometry, T. Mora and C. Traverso, eds., Progress in Math.94, Birkh\u00e4user (1991), 31?45.","DOI":"10.1007\/978-1-4612-0441-1_3"},{"key":"CR7","unstructured":"F. Chaqui,Algorithme de calcul d'une base pour les modules projectifs sur K[X,Y] et ?[X], Th\u00e8se 3\u00e8me Cycle, Universit\u00e9 Paris-Sud, Centre d'Orsay (1983)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"A. Chistov, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, inProc. Int. Conf. FCT 1985, Springer LN Comp. Sci.199 (1985), 63?69.","DOI":"10.1007\/BFb0028792"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/mana.19901490118","volume":"149","author":"N. Fitchas","year":"1990","unstructured":"N. Fitchas andA. Galligo, Nullstellensatz effectif et Conjecture de Serre (Th\u00e9or\u00e8me de Quillen-Suslin) pour le Calcul Formel,Math. Nachr. 149 (1990), 231?253.","journal-title":"Math. Nachr."},{"key":"CR10","unstructured":"N. Fitchas, A. Galligo and J. Morgenstern, Algorithmes rapides en s\u00e9quentiel et en parall\u00e8le pour l'\u00e9limination des quantificateurs en g\u00e9om\u00e9trie \u00e9l\u00e9mentaire, in F. Delon, M. Dickmann, D. Gondard (eds.),S\u00e9minaire Structures Alg\u00e9briques Ordonn\u00e9es: S\u00e9lection d'expos\u00e9s 1986?1987. Publ. Universit\u00e9 Paris VII32 (1990), 103?145."},{"key":"CR11","volume-title":"Teorya matrits. English version:The theory of matrices, Volume I","author":"F. R. Gantmacher","year":"1977","unstructured":"F. R. Gantmacher,Teorya matrits. English version:The theory of matrices, Volume I, Chelsea Publishing Company, New York (1977)."},{"key":"CR12","first-page":"93","volume":"233","author":"J Gathen von zur","year":"1986","unstructured":"J von zur Gathen, Parallel arithmetic computations: a survey,Proc. 13-th Symp. MFCS 1986, Springer LN Comp. Sci.233 (1986), 93?112.","journal-title":"Proc. 13-th Symp. MFCS 1986, Springer LN Comp. Sci."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1007\/BF01206635","volume":"95","author":"G. Hermann","year":"1926","unstructured":"G. Hermann, Die Frage der endlich vielen Schritte in der Theorie der Polynomideale,Math. Ann. 95 (1926), 736?788.","journal-title":"Math. Ann."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"963","DOI":"10.2307\/1990996","volume":"1","author":"J. Koll\u00e1r","year":"1988","unstructured":"J. Koll\u00e1r, Sharp effective Nullstellensatz,J. Am. Math. Soc. 1 (1988), 963?975.","journal-title":"J. Am. Math. Soc."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"E. Kunz,Einf\u00fchrnug in die kommutative Algebra und algebraische Geometrie, F. Vieweg und S\u00f6hne, Braunschweig-Wiesbaden (1980).","DOI":"10.1007\/978-3-322-85526-8"},{"key":"CR16","unstructured":"T. Y. Lam,Serre's Conjecture, Springer LN Math.635 Springer-Verlag (1978)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0021-8693(92)90189-S","volume":"145","author":"A. Logar","year":"1992","unstructured":"A. Logar andB. Sturmfels, Algorithms for Quillen-Suslin Theorem,J. Algebra 145 (1992), 231?239.","journal-title":"J. Algebra"},{"key":"CR18","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 andA. Meyer, The complexity of the word problem for commutative semigroups and polynomial ideals,Advances in Math. 46 (1982), 305?329.","journal-title":"Advances in Math."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"K. Mulmuley, A fast parallel algorithm to compute the rank of a matrix over an arbitrary field,Proc. 18-th Ann. ACM Symp. Theory of Comput. (1986), 338?339.","DOI":"10.1145\/12130.12164"},{"key":"CR20","unstructured":"P. Philippon,Th\u00e9or\u00e8me des z\u00e9ros effectif d'apr\u00e8s J.Koll\u00e1r, Probl. Dioph. 1988?89, Publ. Math. Univ. Paris VI88 (1988)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1090\/S0002-9947-1974-0349648-2","volume":"197","author":"S. Seidenberg","year":"1974","unstructured":"S. Seidenberg, Constructions in AlgebraTrans. Amer. Math. Soc. 197 (1974), 273?313.","journal-title":"Trans. Amer. Math. Soc."},{"key":"CR22","first-page":"191","volume":"61","author":"J. P. Serre","year":"1955","unstructured":"J. P. Serre, Faisceaux alg\u00e9briques coh\u00e9rents,Amer. Math. 61 (1955), 191?274.","journal-title":"Amer. Math."},{"key":"CR23","first-page":"107","volume":"189?190","author":"B. Teissier","year":"1991","unstructured":"B. Teissier, R\u00e9sultats r\u00e9cents d'alg\u00e8bre commutative effective,S\u00e9minaire Bourbaki. Volume 1989\/90, Expos\u00e9 718, Ast\u00e9risque189?190 (1991), 107?131.","journal-title":"S\u00e9minaire Bourbaki"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200406.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200406\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:57:15Z","timestamp":1586120235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01200406"],"URL":"https:\/\/doi.org\/10.1007\/bf01200406","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}