0 - 1永久不= p完全，一个更简单的证明

[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI:10.1109/ISTCS.1993.253457

A. Ben-Dor, S. Halevi

{"title":"0 - 1永久不= p完全，一个更简单的证明","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":"{\"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}","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

摘要

Valiant(1979)证明了计算01矩阵的永久性是不完全的。作者对同样的结果提出了另一个证明。该证明使用了“黑箱”方法，这有利于其呈现。他们也证明了判定恒数是否能被一个小素数整除不是= p难的。他们的结论是，在“合理的”复杂性假设下，多项式有界函数不可能是非p完全的。

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

查看原文本刊更多论文

Zero-one permanent is not=P-complete, a simpler proof

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.<>

求助全文

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

来源期刊

[1993] The 2nd Israel Symposium on Theory and Computing Systems

自引率

0.00%

发文量