Version history

Submission versions

  1. lax-323828current version

    Håstad’s inapproximability of Max Clique

  2. lax-253009viewing

    Håstad’s inapproximability of Max Clique

    GitHub sourceShown on this page

Proof of `Randomized computations as NP certificates` (1st statement)

groundedproofs/Lax253009Proofs/RandomizedContainments.lean · lax-253009

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The certificate is a complete random tape. Its verifier parses the registered pair encoding, checks the tape length, and simulates the registered procedure.