{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:44:52Z","timestamp":1742924692819,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_45","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"624-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space"],"prefix":"10.1007","author":[{"given":"Noriyuki","family":"Fujimoto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Brent, R.P.: Multiple-precision zero-finding methods and the complexity of elementary function evaluation. In: Analytic Computational Complexity, pp. 151\u2013176. Academic Press (1975)","DOI":"10.1016\/B978-0-12-697560-4.50014-9"},{"key":"45_CR2","unstructured":"Brent, R.P.: The complexity of multiple-precision arithmetic. In: Complexity of Computational Problem Solving. University of Queensland Press (1976)"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/321941.321944","volume":"23","author":"RP Brent","year":"1976","unstructured":"Brent, R.P.: Fast multiple-precision evaluation of elementary functions. J. ACM 23, 242\u2013251 (1976)","journal-title":"J. ACM"},{"key":"45_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277980","volume-title":"Classical Algebra: Its Nature, Origins, and Uses","author":"RL Cooke","year":"2008","unstructured":"Cooke, R.L.: Classical Algebra: Its Nature, Origins, and Uses. Wiley, Hoboken (2008)"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"De, A., Kurur, P.P., Saha, C., Saptharishi, R.: Fast integer multiplication using modular arithmetic. In: ACM Symposium on Theory of Computation (STOC), pp. 499\u2013506 (2008)","DOI":"10.1145\/1374376.1374447"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster integer multiplication. In: ACM Symposium on Theory of computing (STOC), pp. 57\u201366 (2007)","DOI":"10.1145\/1250790.1250800"},{"key":"45_CR7","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W H Freeman & Co. (Sd), San Francisco (1979)"},{"key":"45_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"key":"45_CR9","volume-title":"Concrete Mathematics","author":"DE Knuth","year":"1994","unstructured":"Knuth, D.E.: Concrete Mathematics. Addison-Wesley Professional, Boston (1994)"},{"key":"45_CR10","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: Seminumerical Algorithms. The Art of Computer Programming, vol. 2. Addison-Wesley Professional, Boston (1997)"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: ACM Symposium on Theory of Computing (STOC), pp. 321\u2013330 (2010)","DOI":"10.1145\/1806689.1806735"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-27848-8_517-1","volume-title":"Encyclopedia of Algorithms","author":"J Nederlof","year":"2015","unstructured":"Nederlof, J.: Exact algorithms and time\/space tradeoffs. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1\u20135. Springer, Heidelberg (2015)"},{"issue":"7","key":"45_CR13","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1109\/78.398732","volume":"43","author":"SR Tate","year":"1995","unstructured":"Tate, S.R.: Stable computation of the complex roots of unity. IEEE Trans. Sig. Process. 43(7), 1709\u20131711 (1995)","journal-title":"IEEE Trans. Sig. Process."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:19:39Z","timestamp":1558477179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/cocoa2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}