Wikipedia:Articles for deletion/Permanent is sharp-P-complete
This result is fundamental to both permanents (and a lot of work on the borders between statistical mechanics and combinatorics) and the theory of #P-completeness (and the polynomial hierarchy more generally) in computational complexity. And as someone else pointed out it's too long to be merged into either of its parent articles. The following argument is kind of |waxy, but still, if you're going to get rid of this, you might as well get rid of all of :Category:Article proofs and reduce Wikipedia to more of a Schaum's outline of mathematical results, asserted to be true and with pointers to the literature, but with all explanations of why they're true excised. The article could use improvement (too much first person) and I don't care for the title (should be a noun phrase such as Sharp-P-completeness of the permanent rather than a sentence) but those aren't reasons for deletion
— User:David, 17:18, 17 December 2008 (UTC)
Stance: keep
Cited policy: WP:WAX (Wikipedia:Arguments to avoid in deletion discussions)