1. complexity theory: Time Hierarchy theorem and Space Hierarchy theorem

    complexity theory: Time Hierarchy theorem and Space Hierarchy theorem

    58
    6
    11
  2. Complexity theory introduction to Polynomial hierarchy

    Complexity theory introduction to Polynomial hierarchy

    30
    6
    2
  3. Basic Complexity class: P, NP, PSPACE and EXP classes

    Basic Complexity class: P, NP, PSPACE and EXP classes

    28
    7
    7
  4. Computational complexity: Graph non isomorphism is in IP

    Computational complexity: Graph non isomorphism is in IP

    3
    0
    8
  5. Computational complexity: Prove IP is subset of PSPACE

    Computational complexity: Prove IP is subset of PSPACE

    4
  6. No Scientific Innovation Since the 1920s? Is Academia's 'Publish or Perish' Stifling Science?

    No Scientific Innovation Since the 1920s? Is Academia's 'Publish or Perish' Stifling Science?

    28
    0
    3.53K
    8
  7. Computational complexity of bounded error quantum polynomial time BQP (2)

    Computational complexity of bounded error quantum polynomial time BQP (2)

  8. Austrian Economics and Complex Systems with Rahim Taghizadegan (WiM376)

    Austrian Economics and Complex Systems with Rahim Taghizadegan (WiM376)

    6
    0
    352
  9. Simon’s problem and Oracle separation showing BPP^A ⊈ BQP^A

    Simon’s problem and Oracle separation showing BPP^A ⊈ BQP^A

    2
  10. sinx+sin2x+sin3x+...+sin nx, cosx+cos2x+cos3x+cos 4 x+...+cos nx

    sinx+sin2x+sin3x+...+sin nx, cosx+cos2x+cos3x+cos 4 x+...+cos nx

    16
    2
    7
  11. introduction to randomized computational complexity BPP PP RP etc

    introduction to randomized computational complexity BPP PP RP etc

    24
    4
    86
  12. Goldbach's theorem: Fermat numbers are coprime

    Goldbach's theorem: Fermat numbers are coprime

    38
    5
    13
  13. Relativizing the P vs NP Question (1) P^A=NP^A

    Relativizing the P vs NP Question (1) P^A=NP^A

    36
    5
    1
  14. Sipser–Lautemann theorem and its proof

    Sipser–Lautemann theorem and its proof

    34
    8
  15. Ladner's theorem proof by assuming exponential time hypothesis

    Ladner's theorem proof by assuming exponential time hypothesis

    32
    4
    1
  16. Manahey's theorem and its proof

    Manahey's theorem and its proof

    38
    5
    3
  17. Relativizing the P vs NP P^B not equal NP^B: baker gill solovay theorem

    Relativizing the P vs NP P^B not equal NP^B: baker gill solovay theorem

    37
    5
    3
  18. introduce Weird complexity class, TFNP PPA, PPAD, PPP

    introduce Weird complexity class, TFNP PPA, PPAD, PPP

  19. Prove and Explain Cook Levin Theorem

    Prove and Explain Cook Levin Theorem

    5
  20. prove IP=PSPACE (2) Prove TQBF is in PSPACE

    prove IP=PSPACE (2) Prove TQBF is in PSPACE

    5
  21. prove IP=PSPACE (1) prove sharp p subset of IP

    prove IP=PSPACE (1) prove sharp p subset of IP

    4
  22. Prove and Explain Savitch's Theorem and non deterministic space

    Prove and Explain Savitch's Theorem and non deterministic space

    5
  23. This is a game changer! (AlphaTensor by DeepMind explained)

    This is a game changer! (AlphaTensor by DeepMind explained)

    27
    5
    123
  24. Computational complexity proving NP is a subset of PP

    Computational complexity proving NP is a subset of PP

    32
    5
    3