np完全

Automata and Computability Pub Date : 2019-03-04 DOI:10.1201/9781315148175-19

Ganesh Gopalakrishnan

{"title":"np完全","authors":"Ganesh Gopalakrishnan","doi":"10.1201/9781315148175-19","DOIUrl":null,"url":null,"abstract":"Why study problems in NP? Papadimitriou and Steiglitz, page 351: “The recognition versions of all reasonable combinatorial optimization problems are in NP , . . . (because) . . . combinatorial optimization problems aim for the optimal design of objects. It is reasonable to expect that, once found, the optimal solution can be written down concisely, and thus serve as a certificate for the recognition version.”","PeriodicalId":139478,"journal":{"name":"Automata and Computability","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"NP-Completeness\",\"authors\":\"Ganesh Gopalakrishnan\",\"doi\":\"10.1201/9781315148175-19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Why study problems in NP? Papadimitriou and Steiglitz, page 351: “The recognition versions of all reasonable combinatorial optimization problems are in NP , . . . (because) . . . combinatorial optimization problems aim for the optimal design of objects. It is reasonable to expect that, once found, the optimal solution can be written down concisely, and thus serve as a certificate for the recognition version.”\",\"PeriodicalId\":139478,\"journal\":{\"name\":\"Automata and Computability\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automata and Computability\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/9781315148175-19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automata and Computability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9781315148175-19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

为什么要研究NP中的问题?Papadimitriou和Steiglitz，第351页:“所有合理的组合优化问题的识别版本都是NP，……(因为)……组合优化问题的目标是对象的优化设计。我们有理由期望，一旦找到最优解，就可以简洁地写下，从而作为识别版本的证明。”

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

查看原文本刊更多论文

NP-Completeness

Why study problems in NP? Papadimitriou and Steiglitz, page 351: “The recognition versions of all reasonable combinatorial optimization problems are in NP , . . . (because) . . . combinatorial optimization problems aim for the optimal design of objects. It is reasonable to expect that, once found, the optimal solution can be written down concisely, and thus serve as a certificate for the recognition version.”

求助全文

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

来源期刊

Automata and Computability

自引率

0.00%

发文量