{"title":"Hardness amplification within NP","authors":"R. O'Donnell","doi":"10.1145/509907.510015","DOIUrl":null,"url":null,"abstract":"We investigate whether, if NP is slightly hard on average, it is very hard on average.","PeriodicalId":193513,"journal":{"name":"Proceedings 17th IEEE Annual Conference on Computational Complexity","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"116","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 17th IEEE Annual Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/509907.510015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 116
Abstract
We investigate whether, if NP is slightly hard on average, it is very hard on average.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
