Fast algorithms for N-dimensional restrictions of hard problems
F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.
Download
No fulltext has been uploaded.
Journal Article
| Published
| English
Publishing Year
Journal Title
Journal of the ACM (JACM)
Page
740-747
LibreCat-ID
Cite this
Meyer auf der Heide F. Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM). 1988:740-747. doi:10.1145/44483.44490
Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747. https://doi.org/10.1145/44483.44490
@article{Meyer auf der Heide_1988, title={Fast algorithms for N-dimensional restrictions of hard problems}, DOI={10.1145/44483.44490}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1988}, pages={740–747} }
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Journal of the ACM (JACM), 1988, 740–47. https://doi.org/10.1145/44483.44490.
F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of hard problems,” Journal of the ACM (JACM), pp. 740–747, 1988.
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Journal of the ACM (JACM), 1988, pp. 740–47, doi:10.1145/44483.44490.
Google Scholar