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: Demonstrate your protocol with the following example: (x1+x2)*(~x1+x3+~x4)*(x1+x2+~x4) )*(x2+~x2) How many messages should be sent to have the error less than 40%. 2. Consider the following problem. Unique Satisfiability Problem (USat) Instance : A wff W. Question : Is W unique satisfiable? That is, there is exactly one assignment that makes W true. For example W=(x1+x2)(x1+~x2)x2 is uniquely satisfiable (x1=t, x2=t), but W= (x1+x2)(x1+~x2) is not uniquely satisfiable since (x1=t, x2 = t) (x1=t, x2 = f) are satisfying assignments for W. What is the complexity of USat problem in the polynomial time hierarchy? Prove your claim. 3. Solve 9.13 4. Solve 5.12 5. Solve 6.20 6. Let DIST = {<G, s, t, d>  d is the length of the shortest path from s to t in directed graph G}. In other words, <G, s, t, d> ∈ DIST if and only if there is no path from s to t in G of length d1, but there is such a path of length d. Show that DIST is NLcomplete. 7. Solve 4.17...
View
Full
Document
This note was uploaded on 07/25/2008 for the course CSE 860 taught by Professor Chung during the Spring '04 term at Michigan State University.
 Spring '04
 CHUNG

Click to edit the document details