RSS Amplifier

Topic · bound protocol

bound protocol

The 13 most recent episodes and tracks on this topic.

Saves to your Watch queue, to pick up on another day or another device.

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

  1. CSE204, Lec 19: Basic of cryptography, from a complexity perspectiveCSE204, Spring 2022: Computational Complexity TheoryNotes
  2. CSE204, Lec 17: Proving the Sumcheck protocol for #SAT, a short discussion about MIPCSE204, Spring 2022: Computational Complexity TheoryNotes
  3. CSE204, Lec 18: The PCP theorem and hardness of approximationCSE204, Spring 2022: Computational Complexity TheoryNotes
  4. CSE204, Lec 16: Proving the set lower bound protocol, and starting the proof that IP = PSPACECSE204, Spring 2022: Computational Complexity TheoryNotes
  5. CSE204, Lec 15: Arthur-Merlin protocols and the Goldwasser-Sipser set lower bound protocolCSE204, Spring 2022: Computational Complexity TheoryNotes
  6. CSE204, Lec 13: Relating BPP to other complexity classesCSE204, Spring 2022: Computational Complexity TheoryNotes
  7. CSE2014, Lec 12: Introduction to randomized complexity classes and BPPCSE204, Spring 2022: Computational Complexity TheoryNotes
  8. CSE204, Lec 14: Introduction to Interactive ProtocolsCSE204, Spring 2022: Computational Complexity TheoryNotes
  9. CSE 204, Lec 10, Part 1: Complete languages for the polynomial hierarchyCSE204, Spring 2022: Computational Complexity TheoryNotes
  10. CSE204, Lec 10, Part 2: Introduction to circuit complexityCSE204, Spring 2022: Computational Complexity TheoryNotes
  11. CSE204, Lec 9: Equivalences of definitions of the polynomial hierarchyCSE204, Spring 2022: Computational Complexity TheoryNotes
  12. CSE204, Lec 3: 3SAT is NP-complete, and the class co-NPCSE204, Spring 2022: Computational Complexity TheoryNotes
  13. CSE204, Lec 2: NP-completeness and the Cook-Levin TheoremCSE204, Spring 2022: Computational Complexity TheoryNotes