{"title":"np完备性概念的分离","authors":"A. Pavan, A. Selman","doi":"10.1109/CCC.2001.933875","DOIUrl":null,"url":null,"abstract":"We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce a hypothesis from which we describe a set in NP that is /spl les//sub T//sup P/-complete but not /spl les//sub tt//sup P/-complete. We provide fairly thorough analyses of the hypotheses that we introduce.","PeriodicalId":240268,"journal":{"name":"Proceedings 16th Annual IEEE Conference on Computational Complexity","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Separation of NP-completeness notions\",\"authors\":\"A. Pavan, A. Selman\",\"doi\":\"10.1109/CCC.2001.933875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce a hypothesis from which we describe a set in NP that is /spl les//sub T//sup P/-complete but not /spl les//sub tt//sup P/-complete. We provide fairly thorough analyses of the hypotheses that we introduce.\",\"PeriodicalId\":240268,\"journal\":{\"name\":\"Proceedings 16th Annual IEEE Conference on Computational Complexity\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 16th Annual IEEE Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2001.933875\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 16th Annual IEEE Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2001.933875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce a hypothesis from which we describe a set in NP that is /spl les//sub T//sup P/-complete but not /spl les//sub tt//sup P/-complete. We provide fairly thorough analyses of the hypotheses that we introduce.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
