{"title":"关于图的简洁表示的注释","authors":"Christos H. Papadimitriou, Mihalis Yannakakis","doi":"10.1016/S0019-9958(86)80009-2","DOIUrl":null,"url":null,"abstract":"<div><p>Galperin and Wigderson (<em>Inform. and Control</em> <strong>56</strong> (1983), 183–198) showed that certain trivial graph properties become NP-complete when the graph is represented in a particular exponentially succinct way. We show that under the same representation, graph properties that are ordinarily NP-complete become complete for non-deterministic exponential time.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"71 3","pages":"Pages 181-185"},"PeriodicalIF":0.0000,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80009-2","citationCount":"186","resultStr":"{\"title\":\"A note on succinct representations of graphs\",\"authors\":\"Christos H. Papadimitriou, Mihalis Yannakakis\",\"doi\":\"10.1016/S0019-9958(86)80009-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Galperin and Wigderson (<em>Inform. and Control</em> <strong>56</strong> (1983), 183–198) showed that certain trivial graph properties become NP-complete when the graph is represented in a particular exponentially succinct way. We show that under the same representation, graph properties that are ordinarily NP-complete become complete for non-deterministic exponential time.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"71 3\",\"pages\":\"Pages 181-185\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80009-2\",\"citationCount\":\"186\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995886800092\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Galperin and Wigderson (Inform. and Control56 (1983), 183–198) showed that certain trivial graph properties become NP-complete when the graph is represented in a particular exponentially succinct way. We show that under the same representation, graph properties that are ordinarily NP-complete become complete for non-deterministic exponential time.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
