{"status":"public","date_created":"2020-04-21T08:51:54Z","_id":"16764","doi":"10.1145/44483.44490","publication":"Journal of the ACM (JACM)","page":"740-747","year":"1988","publication_identifier":{"issn":["0004-5411","1557-735X"]},"user_id":"15415","department":[{"_id":"63"}],"publication_status":"published","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:55Z","type":"journal_article","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>","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.","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>.","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>","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.","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} }","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>."},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"Fast algorithms for N-dimensional restrictions of hard problems"}