Question: The difference hierarchy DiP is defined recursively as a. D 1 P = NP and b. D i P = {A| A = B

The difference hierarchy DiP is defined recursively as

a. D1P = NP and

b. DiP = {A| A = B \ C for B in NP and C in Di−1P}.

(Here B \ C = B ∩ C.)

For example, a language in D2P is the difference of two NP languages. Sometimes D2P is called DP (and may be written DP). Let Z = {〈G1, k1,G2, k2〉| G1 has a k1-clique and G2 doesn’t have a k2-clique}. Show that Z is complete for DP. In other words, show that Z is in DP and every language in DP is polynomial time reducible to Z.

Step by Step Solution

3.46 Rating (175 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Since Z can be expressed as the difference between two NP languag... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction theory computation Questions!