{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T21:05:18Z","timestamp":1773263118128,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00183-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:05Z","timestamp":1027633865000},"page":"71-88","source":"Crossref","is-referenced-by-count":32,"title":["Cook's versus Valiant's hypothesis"],"prefix":"10.1016","volume":"235","author":[{"given":"Peter","family":"B\u00fcrgisser","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00183-8_BIB1","doi-asserted-by":"crossref","unstructured":"L. Adleman, Two theorems on random polynomial time, Proceedings of the 19th IEEE Symposium on Foundations of Comp. Science, 1978, pp. 75\u201383.","DOI":"10.1109\/SFCS.1978.37"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01200057","article-title":"Arithmetization: a new method in structural complexity theory","volume":"1","author":"Babai","year":"1991","journal-title":"Comp. Compl."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB3","doi-asserted-by":"crossref","unstructured":"L. Blum, F. Cucker, M. Shub, S. Smale, Algebraic Settings for the Problem \u201cP\u2260 NP?\u201d, The Mathematics of Numerical Analysis, No. 32, Lectures in Applied Mathematics, American Mathematical Society, Providence, RI, pp. 125\u2013144.","DOI":"10.1007\/978-1-4612-0701-6_7"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB5","unstructured":"P. B\u00fcrgisser, Completeness and Reduction in Algebraic Complexity Theory, Habilitationsschrift Universit\u00e4t Z\u00fcrich, Algorithms and Computation in Mathematics, Vol. 7, Springer, Berlin, to appear."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB6","first-page":"73","article-title":"On the structure of Valiant's complexity classes","volume":"3","author":"B\u00fcrgisser","year":"1999","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB7","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser, M. Clausen, M.A. Shokrollahi, Algebraic Complexity Theory, Grundlehren der mathematischen Wissenschaften, Vol. 315, Springer, Berlin, 1997.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB8","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem proving procedures, Proceedings of the 3rd ACM STOC, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/S0097539794270340","article-title":"On the power of real Turing machines over binary inputs","volume":"26","author":"Cucker","year":"1997","journal-title":"SIAM J. Comp."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0747-7171(87)80063-9","article-title":"Feasible arithmetic computations: Valiant's hypothesis","volume":"4","author":"von zur Gathen","year":"1987","journal-title":"J. Symb. Comp."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB11","series-title":"Proceedings Cortona Conference on Computational Algebraic Geometry and Commutative Algebra","article-title":"La d\u00e9termination des points isol\u00e9s et de la dimension d'une variet\u00e9 alg\u00e9brique peut se faire en temps polynomial","author":"Giusti","year":"1993"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB12","first-page":"61","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB13","unstructured":"R.M. Karp, R.J. Lipton, Turing machines that take advice, Logic and Algorithmic: An international Symposium held in honor of Ernst Specker, Monogr. No. 30 de l'Enseign. Math., 1982, pp. 255\u2013273."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB14","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB15","doi-asserted-by":"crossref","unstructured":"P. Koiran, A weak version of the Blum\u2013Shub\u2013Smale model, Proceedings of the 34th FOCS, 1993, pp. 486\u2013495.","DOI":"10.1109\/SFCS.1993.366838"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB16","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. Compl."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB17","first-page":"407","article-title":"Une approche informatique pour l'approximation diophantienne","volume":"318","author":"Krick","year":"1994","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB18","doi-asserted-by":"crossref","unstructured":"T. Krick, L.M. Pardo, A computational method for diophantine approximation, in: L. Gonz\u00e1lez-Vega, T. Recio (Eds.), Proceedings of the MEGA\u201994, Progress in Mathematics, Vol. 143, Birkh\u00e4user, Basel, 1996, pp. 193\u2013253.","DOI":"10.1007\/978-3-0348-9104-2_11"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB19","unstructured":"J.C. Lagarias, A.M. Odlyzko, Effective versions of the Chebotarev density theorem, Algebraic Number Fields, Proceedings of the 1975 Durham Symposium, Academic Press, New York, 1977, pp. 409\u2013464."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB20","series-title":"Number Fields","author":"Marcus","year":"1977"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB21","series-title":"Computer Algebra, Symbolic and Algebraic Computation","first-page":"259","article-title":"Some useful bounds","author":"Mignotte","year":"1982"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB22","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, Completeness classes in algebra, Proceedings of the 11th ACM STOC, 1979, pp. 249\u2013261.","DOI":"10.1145\/800135.804419"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comp. Sci."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB24","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comp."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB25","unstructured":"L.G. Valiant, Reducibility by algebraic projections, Logic and Algorithmic: an International Symposium held in honor of Ernst Specker, Monogr. No. 30 de l'Enseign. Math., 1982, pp. 365\u2013380."},{"issue":"4","key":"10.1016\/S0304-3975(99)00183-8_BIB26","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0212043","article-title":"Fast parallel computation of polynomials using few processors","volume":"12","author":"Valiant","year":"1983","journal-title":"SIAM J. Comp."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB27","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comp. Sci."},{"key":"10.1016\/S0304-3975(99)00183-8_BIB28","doi-asserted-by":"crossref","unstructured":"P.J. Weinberger, On Euclidean rings of algebraic integers, Analytic Number Theory, Proceedings of the Symposium in Pure Mathematics, American Mathematical Society, Providence, RI, 1972, pp. 321\u2013332.","DOI":"10.1090\/pspum\/024\/0337902"},{"key":"10.1016\/S0304-3975(99)00183-8_BIB29","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/0196-6774(84)90025-7","article-title":"Finding the number of factors of a polynomial","volume":"5","author":"Weinberger","year":"1984","journal-title":"J. Algorithms"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001838?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001838?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:19:48Z","timestamp":1580843988000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397599001838"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00183-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}