|Title:|| ZERO-ONE PERMANENT IS # P-COMPLETE,
A SIMPLER PROOF.
|Authors:|| A. Ben-Dor and S. Halevi
In 1979, Valiant proved that computing the permanent of a 01-matrix is #P-Complete. In this paper we present another proof for the same result. Our proof uses ``black box'' methodology, which facilitates its presentation. We also prove that deciding whether the permanent is divisible by a small prime is #P-Hard. We conclude by proving that a polynomially bounded function cannot be #P-Complete under ``reasonable'' complexity assumptions.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1993/CS/CS0781), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1993
To the main CS technical reports page
Computer science department, Technion