Unformatted text preview: 2 ), there is exactly one linear function that ﬁts both points. What sort of singleinput function always uniquely ﬁts t points? (b) Deﬁne the language u 2 sat = { φ  # φ = 2 } , that is, the the language of formulae with exactly 2 satisfying assignments. Use the existence of eﬃciently computable 3wise independent hash functions to prove that NP ⊆ RP u 2 sat . (Note: this can be proven without using 3wise independent hashes, but that is not the solution I’m looking for) Note: The constructions for both of these questions are fairly easy if you have been keeping up in class. What I am primarily looking for is a correct and detailed proof and analysis of the hash family (in part (a)) and oracle RP algorithm (in part (b)). 1...
View
Full Document
 Spring '08
 Sturtivant,C
 Computational complexity theory, hash function, Quantification, Existential quantification

Click to edit the document details