ConceptTheory & Algos
Interactive proof for \#SAT
An interactive proof protocol where the prover sends polynomials at each round and the verifier checks them using random evaluations to prove the number of satisfying assignments of a formula.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.