Author: Mina RazaghpourMina Razaghpour Date: Apr 20, 2008 23:36
You should be able to prove a problem is in NP: it has a polynomial size certificate
and a polynomial time verification algorithm, as in Q4.a in A5.
On Mon, 21 Apr 2008, Ning Zhang wrote:
> In the lecture notes, there are only 3 pages about this topic.
> How much shall we know about Certificates and Verification?
>
>
>
| 
