This preview shows page 1. Sign up to view the full content.
Unformatted text preview: leave it to Arthur to verify in polynomial time). Since Arthur runs in polynomial time, by the CookLevin reduction there is a 3SAT formula x r with free variables a such that x r a ) iF Arthur accepts Merlins argument a , and L T = x r ) : a x r a ) } . Let f x ; r ) = x r . If x L , then with probability at least 2 / 3, Merlin can convince Arthur to accept, meaning x r ) L T and x r 3SAT . In other words, if x L then Pr r [ f x ; r ) 3SAT ] 2 / 3. If x / L , then with probability at most 1 / 3, Merlin can convince Arthur to accept, meaning x r ) L T . In other words, if x / L then Pr r [ f x ; r ) 3SAT ] 1 / 3....
View
Full
Document
This note was uploaded on 10/21/2011 for the course CSCI 5403 taught by Professor Sturtivant,c during the Spring '08 term at Minnesota.
 Spring '08
 Sturtivant,C

Click to edit the document details