This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE450/598 Design And Analysis of Algorithms HW06, Monday, 04/21/2008, Due: Monday, 04/28/2008 Please note that you have to typeset your assignment using either L A T E X or Microsoft Word. Hand-written assignment will not be graded. Also, it is recommended that you save a copy of your assignment on general.asu.edu . All homework assignments are your own work. While you are encourage to discuss the materials studied in class, you are not supposed to discuss the solutions to homework problems. 1. (18 pts) For each of the following four classes, (1) define the class; (2) give a problem that is a member of that class; (3) describe the implications if you know a problem Z is in that class. These four classes also define six classes of problems, each obtained by the intersection of two of the four classes. For each of these six classes, state whether it is (1) empty; (2) non-empty; or (3) unknown whether it is empty or not. • P • NP • NP-hard • NP-Complete SOLUTIONS: • P is the class of problems solvable in polynomial time on a deterministic Turing machine. • Sorting is a member of P ....
View Full Document
This note was uploaded on 05/05/2008 for the course CSE 450 taught by Professor Guoliangxue during the Spring '08 term at ASU.
- Spring '08