{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:34:06Z","timestamp":1725514446815},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_57","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"624-631","source":"Crossref","is-referenced-by-count":0,"title":["Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model"],"prefix":"10.1007","author":[{"given":"Xin","family":"Li","sequence":"first","affiliation":[]},{"given":"Tian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Han","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Liyan","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Hongtao","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Jiaqi","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","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. H. Freeman and Sons, New York (1979)"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., et al.: Toward a Model for Backtracking and Dynamic Programming. In: Proceedings of Twentieth Annual IEEE Conference on Computational Complexity, pp. 308\u2013322 (2005)","DOI":"10.1109\/CCC.2005.32"},{"key":"57_CR3","doi-asserted-by":"publisher","first-page":"541","DOI":"10.2307\/2589349","volume":"23","author":"P. Pudlak","year":"2000","unstructured":"Pudlak, P.: Proofs as games. American Math. Monthly\u00a023, 541\u2013550 (2000)","journal-title":"American Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:27Z","timestamp":1619516307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_57","relation":{},"subject":[]}}