为承诺的NP搜索问题测试实例生成

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI:10.1109/SCT.1994.315803

O. Watanabe

{"title":"为承诺的NP搜索问题测试实例生成","authors":"O. Watanabe","doi":"10.1109/SCT.1994.315803","DOIUrl":null,"url":null,"abstract":"We discuss the problem of generating test instances for promised NP search problems. A technical framework is proposed for studying this problem, and it is shown that all known distNP-hard search problems are \"complete\" for test instance generation problems.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Test instance generation for promised NP search problems\",\"authors\":\"O. Watanabe\",\"doi\":\"10.1109/SCT.1994.315803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss the problem of generating test instances for promised NP search problems. A technical framework is proposed for studying this problem, and it is shown that all known distNP-hard search problems are \\\"complete\\\" for test instance generation problems.<<ETX>>\",\"PeriodicalId\":386782,\"journal\":{\"name\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"volume\":\"144 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1994.315803\",\"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 of IEEE 9th Annual Conference on Structure in Complexity Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1994.315803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

我们讨论了承诺NP搜索问题的测试实例的生成问题。提出了一种研究该问题的技术框架，并证明了所有已知的distnp -硬搜索问题对于测试实例生成问题都是“完整的”

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Test instance generation for promised NP search problems

We discuss the problem of generating test instances for promised NP search problems. A technical framework is proposed for studying this problem, and it is shown that all known distNP-hard search problems are "complete" for test instance generation problems.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory

自引率

0.00%

发文量