hw5 - NP-complete problem that is not parsi-monious. 5....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
University of Maryland CMSC652 — Complexity Theory Professor Jonathan Katz Homework 5 Due at the beginning of class on Dec. 12 1. Arora-Barak, Exercise 11.2. (This result was mentioned in class, but without a rigor- ous proof.) 2. Arora-Barak, Exercise 11.8. 3. Arora-Barak, Exercise 11.11. 4. Give an example of a Karp reduction to an
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online