Wikipedia:Articles for deletion/Permanent is sharp-P-complete
Firstly, . Secondly,  says "include proofs when they expose or illuminate the concept or idea; don't include them when they serve only to establish the correctness of result"; this proof is not unusual or illuminating. It consists of showing that a problem known to be #P-complete is equivalent to the calculating the permanent of a particular matrix, a very standard approach to such complexity proofs. Result could be mentioned in the permanent article, but we don't need to reproduce the blow-by-blow details
— User:Gandalf61, 20:26, 16 December 2008 (UTC)
Stance: delete
Cited policy: WP:NOTTEXTBOOK||WP:MOSMATH (Wikipedia:What Wikipedia is not)