{"title":"搬运工问题的复杂性和归纳","authors":"J. Reif","doi":"10.1109/SFCS.1979.10","DOIUrl":null,"url":null,"abstract":"This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"943","resultStr":"{\"title\":\"Complexity of the mover's problem and generalizations\",\"authors\":\"J. Reif\",\"doi\":\"10.1109/SFCS.1979.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles.\",\"PeriodicalId\":311166,\"journal\":{\"name\":\"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1979-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"943\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1979.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1979.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}