Complexity of the mover's problem and generalizations
Publication
, Conference
Reif, JH
Published in: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
January 1, 1979
This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles.
Duke Scholars
Published In
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOI
ISSN
0272-5428
Publication Date
January 1, 1979
Start / End Page
421 / 427
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J. H. (1979). Complexity of the mover's problem and generalizations. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. 421–427). https://doi.org/10.1109/SFCS.1979.10
Reif, J. H. “Complexity of the mover's problem and generalizations.” In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 421–27, 1979. https://doi.org/10.1109/SFCS.1979.10.
Reif JH. Complexity of the mover's problem and generalizations. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 1979. p. 421–7.
Reif, J. H. “Complexity of the mover's problem and generalizations.” Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 1979, pp. 421–27. Scopus, doi:10.1109/SFCS.1979.10.
Reif JH. Complexity of the mover's problem and generalizations. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 1979. p. 421–427.
Published In
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOI
ISSN
0272-5428
Publication Date
January 1, 1979
Start / End Page
421 / 427