Sign inSign in

Arithmetization

The process of converting a Boolean formula into a polynomial whose values match the Boolean formula on Boolean inputs.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
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.

Polynomials4Branching program3Boolean formulas2Boolean logic2Finite field2Boolean function1Boolean satisfiability1Read-once branching program1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    The process of converting Boolean logic operations into arithmetic operations over integers to allow for non-Boolean inputs.
    • 15:20Probabilistic Computation
    • 1:01:00Probabilistic Computation, BPP
    • 29:24coNP is a Subset of IP
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    The translation of a Boolean SAT instance into a polynomial expression whose value captures clause satisfaction.
    • 2:48The Sherali-Adams Proof System

Connections

8

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

Concepts3

Lectures5

2 lecturers. 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.