{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T13:36:04Z","timestamp":1776692164792,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642151545","type":"print"},{"value":"9783642151552","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_42","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"477-488","source":"Crossref","is-referenced-by-count":8,"title":["The Multivariate Resultant Is NP-hard in Any Characteristic"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Grenet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Koiran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natacha","family":"Portier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S. Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, Cambridge (2009)","edition":"1"},{"issue":"4","key":"42_CR2","first-page":"287","volume":"338","author":"L. Bus\u00e9","year":"2004","unstructured":"Bus\u00e9, L., D\u2019Andrea, C.: On the irreducibility of multivariate subresultants. CR Math.\u00a0338(4), 287\u2013290 (2004)","journal-title":"CR Math."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: A new algebraic method for robot motion planning and real geometry. In: Proc. FOCS 1987, pp. 39\u201348 (1987)","DOI":"10.1109\/SFCS.1987.1"},{"key":"42_CR4","volume-title":"ACM Doctoral Dissertation Award","author":"J.F. Canny","year":"1988","unstructured":"Canny, J.F.: The complexity of robot motion planning. In: ACM Doctoral Dissertation Award, vol.\u00a01987. MIT Press, Cambridge (1988)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Proc. STOC 1988, pp. 460\u2013469 (1988)","DOI":"10.1145\/62212.62257"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Symbolic and Algebraic Computation","author":"J.F. Canny","year":"1989","unstructured":"Canny, J.F.: Generalized characteristic polynomials. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol.\u00a0358. Springer, Heidelberg (1989)"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Canny, J.F., Kaltofen, E., Yagati, L.: Solving systems of nonlinear polynomial equations faster. In: Proc. SIGSAM 1989, pp. 121\u2013128 (1989)","DOI":"10.1145\/74540.74556"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Canny, J.F., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. FOCS 1987, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-27357-3_1","volume-title":"Solving Polynomial Equations","author":"E. Cattani","year":"2005","unstructured":"Cattani, E., Dickenstein, A.: Introduction to residues and resultants. In: Dickenstein, A., Emiris, I. (eds.) Solving Polynomial Equations, pp. 1\u201361. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"42_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0022-4049(00)00145-6","volume":"164","author":"C. D\u2019Andrea","year":"2001","unstructured":"D\u2019Andrea, C., Dickenstein, A.: Explicit formulas for the multivariate resultant. J. Pure Appl. Algebra\u00a0164(1-2), 59\u201386 (2001)","journal-title":"J. Pure Appl. Algebra"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1112\/plms\/s2-6.1.468","volume":"6","author":"A. Dixon","year":"1908","unstructured":"Dixon, A.: The eliminant of three quantics in two independent variables. Proc. Lond. Math. Soc.\u00a06, 468\u2013478 (1908)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1-2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jsco.1998.0266","volume":"28","author":"I. Emiris","year":"1999","unstructured":"Emiris, I., Mourrain, B.: Matrices in elimination theory. J. Symb. Comput.\u00a028(1-2), 3\u201343 (1999)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"42_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1984","unstructured":"Galperin, H., Wigderson, A.: Succinct representations of graphs. Inform. Control\u00a056(3), 183\u2013198 (1984)","journal-title":"Inform. Control"},{"key":"42_CR14","series-title":"Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W.H. Freeman, New York (1979)"},{"key":"42_CR15","unstructured":"Grenet, B.: Difficult\u00e9 du r\u00e9sultant et des grands d\u00e9terminants. Technical report, RRLIP2009-32, LIP (2009), \n                  \n                    http:\/\/prunel.ccsd.cnrs.fr\/ensl-00431714\/"},{"key":"42_CR16","unstructured":"Grenet, B., Koiran, P., Portier, N.: The multivariate resultant is NP-hard in any characteristic. Technical report, RRLIP2009-34, LIP (2009), \n                  \n                    http:\/\/prunel.ccsd.cnrs.fr\/ensl-00440842\/"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Ierardi, D.: Quantifier elimination in the theory of an algebraically-closed field. In: Proc. STOC 1989, pp. 138\u2013147 (1989)","DOI":"10.1145\/73007.73020"},{"issue":"1-2","key":"42_CR18","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jsc.2006.03.006","volume":"42","author":"G. Jeronimo","year":"2007","unstructured":"Jeronimo, G., Sabia, J.: Computing multihomogeneous resultants using straight-line programs. J. Symb. Comput.\u00a042(1-2), 218\u2013235 (2007)","journal-title":"J. Symb. Comput."},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/1073884.1073914","volume-title":"Proc. ISSAC 2005","author":"E. Kaltofen","year":"2005","unstructured":"Kaltofen, E., Koiran, P.: On the complexity of factoring bivariate supersparse (lacunary) polynomials. In: Proc. ISSAC 2005, pp. 208\u2013215. ACM, New York (2005)"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Koiran, P.: Expressing a fraction of two determinants as a determinant. In: Proc. ISSAC 2008, pp. 141\u2013146 (2008)","DOI":"10.1145\/1390768.1390790"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Kapur, D., Saxena, T.: Comparison of various multivariate resultant formulations. In: Proc. ISSAC 1995, pp. 187\u2013194 (1995)","DOI":"10.1145\/220346.220370"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Kapur, D., Saxena, T., Yang, L.: Algebraic and geometric reasoning using Dixon resultants. In: Proc. ISSAC 1994, pp. 99\u2013107 (1994)","DOI":"10.1145\/190347.190372"},{"issue":"4","key":"42_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jcom.1996.0019","volume":"12","author":"P. Koiran","year":"1996","unstructured":"Koiran, P.: Hilbert\u2019s Nullstellensatz is in the polynomial hierarchy. J. Complexity\u00a012(4), 273\u2013286 (1996)","journal-title":"J. Complexity"},{"issue":"1","key":"42_CR24","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1006\/jcom.1999.0536","volume":"16","author":"P. Koiran","year":"2000","unstructured":"Koiran, P.: The complexity of local dimensions for constructible sets. J. Complexity\u00a016(1), 311\u2013323 (2000)","journal-title":"J. Complexity"},{"issue":"1","key":"42_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(81)90064-5","volume":"15","author":"D. Lazard","year":"1981","unstructured":"Lazard, D.: R\u00e9solution des syst\u00e9mes d\u2019\u00e8quations alg\u00e9briques. Theor. Comput. Sci.\u00a015(1), 77\u2013110 (1981)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"42_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1112\/plms\/s1-35.1.3","volume":"1","author":"F.S. Macaulay","year":"1902","unstructured":"Macaulay, F.S.: Some formulae in elimination. Proc. Lond. Math. Soc.\u00a01(1), 3 (1902)","journal-title":"Proc. Lond. Math. Soc."},{"key":"42_CR27","volume-title":"The Algebraic Theory of Modular Systems","author":"F.S. Macaulay","year":"1994","unstructured":"Macaulay, F.S.: The Algebraic Theory of Modular Systems. Cambridge Mathematical Library, Cambridge University Press, Cambridge (1994)"},{"issue":"1-2","key":"42_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(84)90130-0","volume":"31","author":"D.A. Plaisted","year":"1984","unstructured":"Plaisted, D.A.: New NP-hard and NP-complete polynomial and integer divisibility problems. Theor. Comput. Sci.\u00a031(1-2), 125\u2013138 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR29","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/0218024","volume":"18","author":"J. Renegar","year":"1989","unstructured":"Renegar, J.: On the worst-case arithmetic complexity of approximating zeros of systems of polynomials. SIAM J. Comput.\u00a018, 350 (1989)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"42_CR30","doi-asserted-by":"publisher","first-page":"365","DOI":"10.2307\/1969640","volume":"60","author":"A. Seidenberg","year":"1954","unstructured":"Seidenberg, A.: A new decision method for elementary algebra. Ann. Math.\u00a060(2), 365\u2013374 (1954)","journal-title":"Ann. Math."},{"issue":"189","key":"42_CR31","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1090\/S0025-5718-1990-0993933-0","volume":"54","author":"V. Shoup","year":"1990","unstructured":"Shoup, V.: New algorithms for finding irreducible polynomials over finite fields. Math. Comput.\u00a054(189), 435\u2013447 (1990)","journal-title":"Math. Comput."},{"key":"42_CR32","unstructured":"Sturmfels, B.: Sparse elimination theory. In: Eisenbud, D., Robbiano, L. (eds.) Proc. Comput. Algebr. Geom. Commut. Algebra (1991)"},{"key":"42_CR33","volume-title":"Modern Algebra","author":"B.L. Waerden van der","year":"1950","unstructured":"van der Waerden, B.L.: Modern Algebra, 3rd edn. F. Ungar Publishing Co, New York (1950)","edition":"3"},{"issue":"1","key":"42_CR34","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF01202042","volume":"6","author":"J. Gathen von zur","year":"1996","unstructured":"von zur Gathen, J., Karpinski, M., Shparlinski, I.: Counting curves and their projections. Comput. Complex\u00a06(1), 64\u201399 (1996)","journal-title":"Comput. Complex"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:44Z","timestamp":1606186904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}