{"type":"journal_article","user_id":"15415","title":"A lower time bound for the knapsack problem on random access machines","date_updated":"2022-01-06T06:52:56Z","author":[{"full_name":"Klein, Peter","first_name":"Peter","last_name":"Klein"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"status":"public","page":"385-395","publication":"Acta Informatica","date_created":"2020-04-22T08:49:58Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0001-5903","1432-0525"]},"citation":{"ieee":"P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack problem on random access machines,” Acta Informatica, pp. 385–395, 1983.","short":"P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.","mla":"Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, pp. 385–95, doi:10.1007/bf00290735.","chicago":"Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, 385–95. https://doi.org/10.1007/bf00290735.","ama":"Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem on random access machines. Acta Informatica. 1983:385-395. doi:10.1007/bf00290735","apa":"Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395. https://doi.org/10.1007/bf00290735","bibtex":"@article{Klein_Meyer auf der Heide_1983, title={A lower time bound for the knapsack problem on random access machines}, DOI={10.1007/bf00290735}, journal={Acta Informatica}, author={Klein, Peter and Meyer auf der Heide, Friedhelm}, year={1983}, pages={385–395} }"},"year":"1983","_id":"16807","department":[{"_id":"63"}],"doi":"10.1007/bf00290735","publication_status":"published"}