{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:54Z","timestamp":1760245014441,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6225,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(96)00002-3","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"301-306","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generalized Knapsack problems and fixed degree separations"],"prefix":"10.1016","volume":"161","author":[{"given":"Felipe","family":"Cucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Shub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00002-3_BIB1","article-title":"Structural Complexity II","volume":"Vol. 22","author":"Balc\u00e1zar","year":"1990"},{"key":"10.1016\/0304-3975(96)00002-3_BIB2","series-title":"Proc. 15th ACM STOC","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983"},{"issue":"1","key":"10.1016\/0304-3975(96)00002-3_BIB3","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: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(96)00002-3_BIB4","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jcom.1995.1018","article-title":"Computing over the reals with addition and order: higher complexity classes","volume":"11","author":"Cucker","year":"1995","journal-title":"J. of Complexity"},{"key":"10.1016\/0304-3975(96)00002-3_BIB5","unstructured":"F. Cucker and M. Matamala, On digital nondeterminism, Math. Systems Theory, to appear."},{"key":"10.1016\/0304-3975(96)00002-3_BIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)00069-7","article-title":"Complexity separations in Koiran's weak model","volume":"133","author":"Cucker","year":"1994","journal-title":"Theoret. Comput. Sci."},{"year":"1977","series-title":"Algebraic Geometry","author":"Hartshorne","key":"10.1016\/0304-3975(96)00002-3_BIB7"},{"key":"10.1016\/0304-3975(96)00002-3_BIB8","series-title":"Proc. 34th FOCS Symp.","first-page":"486","article-title":"A weak version of the Blum, Shub & Smale model","author":"Koiran","year":"1993"},{"key":"10.1016\/0304-3975(96)00002-3_BIB9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(93)00063-B","article-title":"Computing over the reals with addition and order","volume":"133","author":"Koiran","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(96)00002-3_BIB10","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/828.322450","article-title":"A polynomial linear search algorithm for the n-dimensional Knapsack problem","volume":"31","author":"der Heide","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(96)00002-3_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01270397","article-title":"Lower bounds for arithmetic networks","volume":"4","author":"Monta\u00f1a","year":"1993","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"year":"1971","series-title":"Threshold Logic and its Applications","author":"Muroga","key":"10.1016\/0304-3975(96)00002-3_BIB12"},{"key":"10.1016\/0304-3975(96)00002-3_BIB13","series-title":"Proc. of 24th FOCS","first-page":"429","article-title":"On determinism versus nondeterminism and related problems","author":"Paul","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000023?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000023?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:17:45Z","timestamp":1757477865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596000023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397596000023"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00002-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1996,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized Knapsack problems and fixed degree separations","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(96)00002-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}