Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU

Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU

Ryan O'Donnell via YouTube Direct link

Introduction

1 of 13

1 of 13

Introduction

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Razborov-Smolensky Lower Bounds for AC0[p] - Graduate Complexity Lecture at CMU

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 Explicit language
  3. 3 Definitions
  4. 4 Theorems
  5. 5 Fermats theorem
  6. 6 Gate by gate replacement
  7. 7 Mod3 gates
  8. 8 Or gates
  9. 9 Error bound
  10. 10 Fix an X
  11. 11 Exercise
  12. 12 Twowise Universal Hashing
  13. 13 P twiddle

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.