This preview shows page 1. Sign up to view the full content.
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) Dene the language u 2 sat = {  # = 2 } , that is, the the language of formulae with exactly 2 satisfying assignments. Use the existence of eciently 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 Im 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

Click to edit the document details