This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 01/13/2012 for the course CMSC 652 taught by Professor Staff during the Fall '08 term at Maryland.
- Fall '08