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

[1]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[2]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[3]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[4]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[5]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[6]  Viktória Zankó,et al.  #P-Completeness via Many-One Reductions , 1990, Int. J. Found. Comput. Sci..