求图广义15-解的最短移动序列是np困难的

{"title":"求图广义15-解的最短移动序列是np困难的","authors":"Oded Goldreich","doi":"10.1007/978-3-642-22670-0_1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":109197,"journal":{"name":"Studies in Complexity and Cryptography","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":"{\"title\":\"Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard\",\"authors\":\"Oded Goldreich\",\"doi\":\"10.1007/978-3-642-22670-0_1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":109197,\"journal\":{\"name\":\"Studies in Complexity and Cryptography\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"60\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Studies in Complexity and Cryptography\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-642-22670-0_1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studies in Complexity and Cryptography","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-22670-0_1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}