{"title":"Zero-one permanent is not=P-complete, a simpler proof","authors":"A. Ben-Dor, S. Halevi","doi":"10.1109/ISTCS.1993.253457","DOIUrl":null,"url":null,"abstract":"Valiant (1979) proved that computing the permanent of a 01-matrix is not=P-complete. The authors present another proof for the same result. The proof uses 'black box' methodology, which facilitates its presentation. They also prove that deciding whether the permanent is divisible by a small prime is not=P-hard. They conclude by proving that a polynomially bounded function can not be not=P-complete under 'reasonable' complexity assumptions.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTCS.1993.253457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25
Abstract
Valiant (1979) proved that computing the permanent of a 01-matrix is not=P-complete. The authors present another proof for the same result. The proof uses 'black box' methodology, which facilitates its presentation. They also prove that deciding whether the permanent is divisible by a small prime is not=P-hard. They conclude by proving that a polynomially bounded function can not be not=P-complete under 'reasonable' complexity assumptions.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1993] The 2nd Israel Symposium on Theory and Computing Systems](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
