{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:42:11Z","timestamp":1769974931500,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0304-3975(98)00261-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"289-304","source":"Crossref","is-referenced-by-count":4,"title":["Elimination of parameters in the polynomial hierarchy"],"prefix":"10.1016","volume":"215","author":[{"given":"Pascal","family":"Koiran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00261-8_BIB1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","article-title":"Arthur-Merlin games, A randomized proof system, and a hierarchy of complexity classes","volume":"36","author":"Babai","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00261-8_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97062-7","article-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB3","series-title":"The Mathematics of Numerical Analysis","first-page":"125","article-title":"Algebraic settings for the problem \u201cP \u2260 NP?\u201d","volume":"vol. 32","author":"Blum","year":"1996"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB4","series-title":"Complexity and Real Computation","author":"Blum","year":"1998"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB5","series-title":"Alg\u00e8bre","author":"Bourbaki","year":"1981"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB6","doi-asserted-by":"crossref","unstructured":"O. Chapuis, P. Koiran, Saturation and stability in the theory of computation over the reals, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/S0168-0072(98)00060-8"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB7","series-title":"Proc. 27th ACM Symp. on Theory of Computing","first-page":"335","article-title":"On real Turing machines that toss coins","author":"Cucker","year":"1995"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB8","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\/S0304-3975(98)00261-8_BIB9_1","series-title":"Logic and Algorithmic (an Internat. Symp. held in honour of Ernst Specker)","first-page":"237","article-title":"Testing polynomials which are easy to compute","author":"Heintz","year":"1982"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB9_2","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"262","author":"Heintz","year":"1980"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB10","series-title":"Proc. 15th Annu. Symp. on Theoretical Aspects of Computer Science","first-page":"499","article-title":"Interactive protocols on the reals","volume":"vol. 1373","author":"Ivanov","year":"1998"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB11","series-title":"Proc. 36th IEEE Symp. on Foundations of Computer Science","first-page":"134","article-title":"Approximating the volume of definable sets","author":"Koiran","year":"1995"},{"issue":"4","key":"10.1016\/S0304-3975(98)00261-8_BIB12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jcom.1996.0019","article-title":"Hilbert's Nullstellensatz is in the polynomial hierarchy","volume":"12","author":"Koiran","year":"1996","journal-title":"J. Complexity"},{"issue":"1","key":"10.1016\/S0304-3975(98)00261-8_BIB13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jcom.1997.0433","article-title":"Elimination of constants from machines over algebraically closed fields","volume":"13","author":"Koiran","year":"1997","journal-title":"J. Complexity"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB14","series-title":"Proc. 38th IEEE Symp. on Foundations of Computer Science","first-page":"36","article-title":"Randomized and deterministic algorithms for the dimension of algebraic varieties","author":"Koiran","year":"1997"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB15","doi-asserted-by":"crossref","DOI":"10.1006\/jcom.1999.0502","article-title":"The real dimension problem is NPR-complete","author":"Koiran","year":"1997"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB16","article-title":"Groupes Stables","volume":"2","author":"Poizat","year":"1987","journal-title":"Nur Al-Mantiq Wal-Ma'rifah"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB17","article-title":"Les Petits Cailloux","volume":"3","author":"Poizat","year":"1995"},{"key":"10.1016\/S0304-3975(98)00261-8_BIB18","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomials identities","volume":"27","author":"Schwarz","year":"1980","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002618?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002618?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:51:06Z","timestamp":1555390266000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397598002618"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00261-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}