Certificate (complexity) - Example

Example

L = {<, x, w> | does accept x in |w| steps?} Show L ∈ NP. verifier: gets string c = , x, w such that |c| <= P(|w|) check if c is an accepting computation of M on x with at most |w| steps |c| <= O(|w|3) if we have a computation of a TM with k steps the total size of the computation string is k2 Thus, <, x, w> ∈ L ⇔ there exists c <= a|w|3 such that <, x, w, c> ∈ V ∈ P

Read more about this topic:  Certificate (complexity)

Famous quotes containing the word example:

    “Our intellect is not the most subtle, the most powerful, the most appropriate, instrument for revealing the truth. It is life that, little by little, example by example, permits us to see that what is most important to our heart, or to our mind, is learned not by reasoning but through other agencies. Then it is that the intellect, observing their superiority, abdicates its control to them upon reasoned grounds and agrees to become their collaborator and lackey.”
    —Marcel Proust (1871–1922)