All Videos Channels
  1. Complexity theory introduction to Polynomial hierarchy

    Complexity theory introduction to Polynomial hierarchy

    30
    6
    2
  2. complexity theory: Time Hierarchy theorem and Space Hierarchy theorem

    complexity theory: Time Hierarchy theorem and Space Hierarchy theorem

    58
    6
    9
  3. Basic Complexity class: P, NP, PSPACE and EXP classes

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

    28
    7
  4. Computational complexity: Prove IP is subset of PSPACE

    Computational complexity: Prove IP is subset of PSPACE

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

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

  6. Computational complexity: Graph non isomorphism is in IP

    Computational complexity: Graph non isomorphism is in IP

    3
    0
    8
  7. Simon’s problem and Oracle separation showing BPP^A ⊈ BQP^A

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

    2
  8. 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
    1
  9. Austrian Economics and Complex Systems with Rahim Taghizadegan (WiM376)

    Austrian Economics and Complex Systems with Rahim Taghizadegan (WiM376)

    6
    0
    316
  10. introduce Weird complexity class, TFNP PPA, PPAD, PPP

    introduce Weird complexity class, TFNP PPA, PPAD, PPP

  11. 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
  12. Sipser–Lautemann theorem and its proof

    Sipser–Lautemann theorem and its proof

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

    Ladner's theorem proof by assuming exponential time hypothesis

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

    Manahey's theorem and its proof

    38
    5
    3
  15. 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
  16. Prove and Explain Cook Levin Theorem

    Prove and Explain Cook Levin Theorem

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

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

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

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

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

    Prove and Explain Savitch's Theorem and non deterministic space

    5
  20. Computational complexity proving NP is a subset of PP

    Computational complexity proving NP is a subset of PP

    32
    5
    3
  21. showing Longest PATH is NP Complete

    showing Longest PATH is NP Complete

    7
  22. Proof that Subgraph Isomorphism problem is NP Complete

    Proof that Subgraph Isomorphism problem is NP Complete

  23. Introduce the complexity class P/poly and show that bpp is subset of P/poly

    Introduce the complexity class P/poly and show that bpp is subset of P/poly

    9
  24. Complexity ma and am show that relation to PH (MA subset of sigma2)

    Complexity ma and am show that relation to PH (MA subset of sigma2)

    9