启发式时间层次

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) Pub Date : 2007-06-13 DOI:10.1109/CCC.2007.20

Konstantin Pervyshev

{"title":"启发式时间层次","authors":"Konstantin Pervyshev","doi":"10.1109/CCC.2007.20","DOIUrl":null,"url":null,"abstract":"We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristic algorithms in such syntactic classes as NP and co-NP, and also in semantic classes AM and MA. Further, we present an alternative approach to proving time hierarchies for heuristic algorithms in BPP. This leads to a simpler proof than the one known before.","PeriodicalId":175854,"journal":{"name":"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"On Heuristic Time Hierarchies\",\"authors\":\"Konstantin Pervyshev\",\"doi\":\"10.1109/CCC.2007.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristic algorithms in such syntactic classes as NP and co-NP, and also in semantic classes AM and MA. Further, we present an alternative approach to proving time hierarchies for heuristic algorithms in BPP. This leads to a simpler proof than the one known before.\",\"PeriodicalId\":175854,\"journal\":{\"name\":\"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2007.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2007.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

摘要

我们研究启发式算法的时间层次的存在性。我们证明了启发式算法在NP和co-NP语法类以及AM和MA语义类中存在时间层次。此外，我们提出了一种替代方法来证明启发式算法在BPP中的时间层次。这导致了一个比之前已知的更简单的证明。

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

查看原文本刊更多论文

On Heuristic Time Hierarchies

We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristic algorithms in such syntactic classes as NP and co-NP, and also in semantic classes AM and MA. Further, we present an alternative approach to proving time hierarchies for heuristic algorithms in BPP. This leads to a simpler proof than the one known before.

求助全文

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

来源期刊

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)

自引率

0.00%

发文量