Sign inSign in

Interactive proof for #SAT (first Attempt)

A protocol where a prover and verifier attempt to prove the number of satisfying assignments of a Boolean formula using an interactive sum-check-like process.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Counting satisfiability (#SAT)1Interactive proofs1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.