[{"doi":"10.1145/44483.44490","title":"Fast algorithms for N-dimensional restrictions of hard problems","date_created":"2020-04-21T08:51:54Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:52:55Z","citation":{"ama":"Meyer auf der Heide F. Fast algorithms for N-dimensional restrictions of hard problems. <i>Journal of the ACM (JACM)</i>. 1988:740-747. doi:<a href=\"https://doi.org/10.1145/44483.44490\">10.1145/44483.44490</a>","chicago":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” <i>Journal of the ACM (JACM)</i>, 1988, 740–47. <a href=\"https://doi.org/10.1145/44483.44490\">https://doi.org/10.1145/44483.44490</a>.","ieee":"F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of hard problems,” <i>Journal of the ACM (JACM)</i>, pp. 740–747, 1988.","apa":"Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. <i>Journal of the ACM (JACM)</i>, 740–747. <a href=\"https://doi.org/10.1145/44483.44490\">https://doi.org/10.1145/44483.44490</a>","bibtex":"@article{Meyer auf der Heide_1988, title={Fast algorithms for N-dimensional restrictions of hard problems}, DOI={<a href=\"https://doi.org/10.1145/44483.44490\">10.1145/44483.44490</a>}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1988}, pages={740–747} }","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.","mla":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” <i>Journal of the ACM (JACM)</i>, 1988, pp. 740–47, doi:<a href=\"https://doi.org/10.1145/44483.44490\">10.1145/44483.44490</a>."},"page":"740-747","year":"1988","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16764","status":"public","type":"journal_article","publication":"Journal of the ACM (JACM)"},{"status":"public","type":"journal_article","publication":"Journal of the ACM (JACM)","language":[{"iso":"eng"}],"_id":"16780","user_id":"15415","department":[{"_id":"63"}],"year":"1985","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” <i>Journal of the ACM (JACM)</i>, 1985, 929–37. <a href=\"https://doi.org/10.1145/4221.4250\">https://doi.org/10.1145/4221.4250</a>.","ieee":"F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” <i>Journal of the ACM (JACM)</i>, pp. 929–937, 1985.","ama":"Meyer auf der Heide F. Lower bounds for solving linear diophantine equations on random access machines. <i>Journal of the ACM (JACM)</i>. 1985:929-937. doi:<a href=\"https://doi.org/10.1145/4221.4250\">10.1145/4221.4250</a>","apa":"Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. <i>Journal of the ACM (JACM)</i>, 929–937. <a href=\"https://doi.org/10.1145/4221.4250\">https://doi.org/10.1145/4221.4250</a>","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937.","bibtex":"@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear diophantine equations on random access machines}, DOI={<a href=\"https://doi.org/10.1145/4221.4250\">10.1145/4221.4250</a>}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={929–937} }","mla":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” <i>Journal of the ACM (JACM)</i>, 1985, pp. 929–37, doi:<a href=\"https://doi.org/10.1145/4221.4250\">10.1145/4221.4250</a>."},"page":"929-937","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]},"title":"Lower bounds for solving linear diophantine equations on random access machines","doi":"10.1145/4221.4250","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T10:16:50Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}]},{"publication_identifier":{"issn":["0004-5411","1557-735X"]},"publication_status":"published","page":"668-676","citation":{"short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676.","bibtex":"@article{Meyer auf der Heide_1984, title={A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem}, DOI={<a href=\"https://doi.org/10.1145/828.322450\">10.1145/828.322450</a>}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1984}, pages={668–676} }","mla":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” <i>Journal of the ACM (JACM)</i>, 1984, pp. 668–76, doi:<a href=\"https://doi.org/10.1145/828.322450\">10.1145/828.322450</a>.","apa":"Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. <i>Journal of the ACM (JACM)</i>, 668–676. <a href=\"https://doi.org/10.1145/828.322450\">https://doi.org/10.1145/828.322450</a>","ama":"Meyer auf der Heide F. A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. <i>Journal of the ACM (JACM)</i>. 1984:668-676. doi:<a href=\"https://doi.org/10.1145/828.322450\">10.1145/828.322450</a>","ieee":"F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem,” <i>Journal of the ACM (JACM)</i>, pp. 668–676, 1984.","chicago":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” <i>Journal of the ACM (JACM)</i>, 1984, 668–76. <a href=\"https://doi.org/10.1145/828.322450\">https://doi.org/10.1145/828.322450</a>."},"year":"1984","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-21T11:25:52Z","date_updated":"2022-01-06T06:52:56Z","doi":"10.1145/828.322450","title":"A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem","publication":"Journal of the ACM (JACM)","type":"journal_article","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16785","language":[{"iso":"eng"}]}]