{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T23:07:30Z","timestamp":1710544050149},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1006\/jagm.2001.1177","type":"journal-article","created":{"date-parts":[[2002,10,6]],"date-time":"2002-10-06T19:46:05Z","timestamp":1033933565000},"page":"52-68","source":"Crossref","is-referenced-by-count":4,"title":["Computing Chow Forms and Some Applications"],"prefix":"10.1006","volume":"41","author":[{"given":"Gabriela","family":"Jeronimo","sequence":"first","affiliation":[]},{"given":"Susana","family":"Puddu","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Sabia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jagm.2001.1177_RF1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","article-title":"On computing the determinant in small parallel time using a small number of processors","volume":"18","author":"Berkowitz","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1006\/jagm.2001.1177_RF2","series-title":"AAECC","article-title":"How to compute the Chow Form of an unmixed polynomial ideal in single exponential time","author":"Caniglia","year":"1990"},{"key":"10.1006\/jagm.2001.1177_RF3","unstructured":"A. L. Chistov, and, D. Y. Grigor'ev, Subexponential Time Solving Systems of Algebraic Equations, LOMI preprint E-9-83, E-10-83, Steklov Institute, Leningrad, 1983."},{"key":"10.1006\/jagm.2001.1177_RF4","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":"Fitchas","year":"1990","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1006\/jagm.2001.1177_RF5","series-title":"Effective Methods in Algebraic Geometry","first-page":"169","article-title":"Algorithmes -disons rapides- pour la d\u00e9composition d'une vari\u00e9t\u00e9 alg\u00e9brique en composantes irr\u00e9ductibles et \u00e9quidimensionnelles","volume":"94","author":"Giusti","year":"1991"},{"key":"10.1006\/jagm.2001.1177_RF6","series-title":"Computational Algebraic Geometry and Commutative Algebra, Proceedings of the Cortona Conference on Computational Algebraic Geometry and Commutative Algebra","article-title":"La d\u00e9termination des points isol\u00e9s et de la dimension d'une veri\u00e9t\u00e9 alg\u00e9brique peut se faire en temps polynomial","volume":"XXXIV","author":"Giusti","year":"1993"},{"key":"10.1006\/jagm.2001.1177_RF7","series-title":"Proc. 5th Internat. Conf. AAECC 5, Menorca, 1987","first-page":"269","article-title":"On the computational complexity of polynomials and bilinear mappings, a survey","volume":"356","author":"Heintz","year":"1989"},{"key":"10.1006\/jagm.2001.1177_RF8","first-page":"237","article-title":"Testing polynomials which are easy to compute","volume":"30","author":"Heintz","year":"1982","journal-title":"Monogr. de l'Enseignement Math."},{"key":"10.1006\/jagm.2001.1177_RF9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/42267.45069","article-title":"Greatest common divisors of polynomials given by straight line programs","volume":"35","author":"Kaltofen","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1006\/jagm.2001.1177_RF10","first-page":"193","article-title":"A computational method for diophantine approximation","volume":"143","author":"Krick","year":"1996","journal-title":"Progress Math."},{"key":"10.1006\/jagm.2001.1177_RF11","first-page":"338","article-title":"A fast parallel algorithm to compute the rank of a matrix over an arbitrary field","author":"Mulmuley","year":"1986","journal-title":"Proc. 18th ACM Symp. Theory of Computing"},{"key":"10.1006\/jagm.2001.1177_RF12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0022-4049(97)00068-6","article-title":"An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs","volume":"129","author":"Puddu","year":"1998","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1006\/jagm.2001.1177_RF13","series-title":"Basic Algebraic Geometry","author":"Shafarevich","year":"1974"},{"key":"10.1006\/jagm.2001.1177_RF14","first-page":"184","article-title":"Vermeidung von Divisionen","volume":"264","author":"Strassen","year":"1973","journal-title":"Crelle J. Reine Angew. Math."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677401911770?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677401911770?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T14:21:12Z","timestamp":1554992472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677401911770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0196677401911770"],"URL":"https:\/\/doi.org\/10.1006\/jagm.2001.1177","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}