01:03

Creating the Easy Theory Textbook #3

Easy Theory

Shared 03/08/2021

22:10

10 Reasons Why Computer Science Theory is Important - Easy Theory

Easy Theory

Shared 09/09/2021

13:03

The Polynomial Hierarchy, what is it? - Easy Theory

Easy Theory

Shared 02/09/2021

19:32

What is the Totally Quantified Boolean Formula (TQBF) problem? - Easy Theory

Easy Theory

Shared 01/09/2021

07:50

What is PSPACE-Complete even mean? - Easy Theory

Easy Theory

Shared 31/08/2021

22:45

Hamiltonian Path is NP-Complete (Directed) - Easy Theory

Easy Theory

Shared 24/08/2021

07:32

It's Impossible to Deal with So Much Space - Easy Theory

Easy Theory

Shared 21/08/2021

27:52

NL-completeness and NL = coNL (Immerman-Szelepcsényi Theorem) - Easy Theory

Easy Theory

Shared 17/08/2021

25:05

The Recursion Theorem: Proof + Examples (Advanced ToC) - Easy Theory

Easy Theory

Shared 14/08/2021

24:56

Logarithmic Space in Complexity Theory - Easy Theory

Easy Theory

Shared 10/08/2021

15:24

How accurate is Tom Scott's "Are There Problems That Computers Can't Solve?" video?

Easy Theory

Shared 07/08/2021

14

That Was Easy...Theory

Easy Theory

Shared 05/08/2021

09:59

What is Space? (for complexity theory) - Easy Theory

Easy Theory

Shared 29/07/2021

43:26

Creating the Easy Theory Textbook #2

Easy Theory

Shared 13/04/2021

31:29

The Cook-Levin Theorem FULL PROOF (Boolean Satisfiability is NP-complete)

Easy Theory

Shared 16/03/2021

09

What is Time (in complexity theory)? - Easy Theory

Easy Theory

Shared 27/01/2021

08:44

The Quicksort Algorithm + more Recursion!

Easy Theory

Shared 07/09/2020

26:03

Savitch's Theorem, Statement + Proof - Easy Theory

Easy Theory

Shared 29/07/2021

07:55

This Computer Science Paper is (Probably) Hilarious

Easy Theory

Shared 27/02/2022

01:19:09

Exponential Lower Bounds for Circuit Families (P ≠ NP)

Easy Theory

Shared 01/04/2023