{"title":"The power of witness reduction","authors":"Sanjay Gupta","doi":"10.1109/SCT.1991.160242","DOIUrl":null,"url":null,"abstract":"Recent results by M. Ogiwara and L.A. Hemachandra (1990) established a connection between functions being hard for a class of functions and functions interacting with the class to effect witness reduction. The author believes that the ability to achieve some form of witness reduction is what makes a function hard for a class of functions. To support this thesis he defines new function classes and obtains results analogous to those of Ogiwara and Hemachandra. He also introduces the notion of randomly hard functions and obtains similar results.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1991.160242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22
Abstract
Recent results by M. Ogiwara and L.A. Hemachandra (1990) established a connection between functions being hard for a class of functions and functions interacting with the class to effect witness reduction. The author believes that the ability to achieve some form of witness reduction is what makes a function hard for a class of functions. To support this thesis he defines new function classes and obtains results analogous to those of Ogiwara and Hemachandra. He also introduces the notion of randomly hard functions and obtains similar results.<>
M. Ogiwara和L.A. Hemachandra(1990)最近的研究结果建立了函数类难以实现的函数与与该类交互的函数之间的联系，以实现证人约简。作者认为，实现某种形式的证人约简的能力是使函数难以成为一类函数的原因。为了支持这一论点，他定义了新的函数类，并得到了类似于Ogiwara和Hemachandra的结果。他还引入了随机硬函数的概念，并得到了类似的结果。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
