Unformatted text preview: NP-complete problem that is not parsi-monious. 5. Prove formally that the problem of computing the permanent of positive integer ma-trices is in # P . (In the lecture notes I gave some initial hints, but they need to be ﬂeshed out to give a complete proof.) 1...
View Full Document
- Fall '08
- Computational complexity theory, Professor Jonathan Katz, positive integer matrices