{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:42:07Z","timestamp":1649112127862},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90008-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"393-399","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds for combinatorial problems on graphs"],"prefix":"10.1016","volume":"6","author":[{"given":"Hiroyuki","family":"Nakayama","sequence":"first","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]},{"given":"Nobuji","family":"Saito","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0196-6774(85)90008-2_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/62.322433","article-title":"Some combinatorial game problems require \u03a9(nk) time","volume":"31","author":"Adachi","year":"1984","journal-title":"J. Assoc. Comput. Mach"},{"key":"10.1016\/0196-6774(85)90008-2_BIB2","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0022-0000(78)90026-0","article-title":"A lower bound of n22 on linear search programs for the knapsack problem","volume":"16","author":"Dobkin","year":"1978","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/0196-6774(85)90008-2_BIB3","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0196-6774(85)90008-2_BIB4","series-title":"Proceedings of the 7th IBM Sympos. Math. Found. Comput. Sci","first-page":"1","article-title":"A lower bound on the complexity of knapsack problem","author":"Machida","year":"1982"},{"key":"10.1016\/0196-6774(85)90008-2_BIB5","series-title":"Proc. of 15th Annu. ACM Sympos. on Theory of Computing","first-page":"70","article-title":"A polynomial linear search algorithm for the n-dimensional knapsack problem","author":"Meyer auf der Heide","year":"1983"},{"key":"10.1016\/0196-6774(85)90008-2_BIB6","series-title":"Internat. Sympos. Math. Programming","first-page":"14","article-title":"On the complexity of discrete programming problems","author":"Mor\u00e1vek","year":"1967"},{"key":"10.1016\/0196-6774(85)90008-2_BIB7","series-title":"Threshold Logic and its Applications","author":"Muroga","year":"1978"},{"key":"10.1016\/0196-6774(85)90008-2_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","article-title":"Lower bounds for algebraic decision trees","volume":"3","author":"Steel","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90008-2_BIB9","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/PGEC.1965.264090","article-title":"A lower bound on the number of threshold functions","volume":"14","author":"Yajima","year":"1965","journal-title":"IEEE Trans. Electr. Comput"},{"issue":"No. 2","key":"10.1016\/0196-6774(85)90008-2_BIB10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Node- and edge-deletion NP-complete problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900082?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900082?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:26:04Z","timestamp":1548725164000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900082"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90008-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}