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: CS 151 Complexity Theory Spring 2011 Problem Set 2 Out: April 7 Due: April 14 Reminder: you are encouraged to work in groups of two or three; however you must turn in your own write-up and note with whom you worked. You may consult the course notes and the text (Papadimitriou). Please attempt all problems. To facilitate grading, please turn in each problem on a separate sheet of paper and put your name on each sheet. Do not staple the separate sheets. 1. A strong nondeterministic Turing Machine has, in addition to its q accept and q reject states, a special state q ? . Such a Turing Machine accepts its input if all computation paths lead to q accept and q ? states, and it rejects its input if all computation paths lead to q reject and q ? states. Moreover, on every input, there is at least one computation path leading to q accept or q reject . Show that the class of languages decided 1 by a strong nondeterministic Turing Machine in polynomial time is exactly NP coNP ....
View Full Document
This document was uploaded on 01/05/2012.
- Fall '09