Sign inSign in

TQBF

The language of true quantified boolean formulas.
as Michael Sipser defines itMITThe wording closest to all 6 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.

Boolean formula3Boolean logic3Quantified Boolean formula3PSPACE-completeness2Quantifier2P-space complexity class1Polynomial space1PSPACE1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    True Quantified Boolean Formula, a PSPACE-complete language.
    • 1:13The Immerman-Szelepcsényi Theorem
    • 59:20Interactive Proofs: IP=PSPACE
    • 1:01:14From P-Completeness to PSPACE-Completeness
    • 23:45Why is P vs. NP Difficult?
  • Michael Sipser

    MIT · Undergraduate

    The language consisting of all true quantified Boolean formulas.
    • 46:15Space Complexity, PSPACE, Savitch's Theorem

Lectures that assume it

1

Connections

11

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

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.