ConceptTheory & Algos
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.
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
1Connections
2The lectures that define it or assume it, and the concepts next to it.