[CSS.203.1] Computational Complexity - Lecture 31

Agenda: Razborov and Smolensky's proof that Parity is not in AC0 Instructor: Ramprasad Saptharishi

STCS TIFR224 views01:34:23

🔥 Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Saudi Arabia under the topic 'new zealand national cricket team vs west indies cricket team match scorecard'.

About this video

Agenda: Razborov and Smolensky's proof that Parity is not in AC0 Instructor: Ramprasad Saptharishi

Video Information

Views
224

Total views since publication

Likes
3

User likes and reactions

Duration
01:34:23

Video length

Published
Jun 7, 2021

Release date

Quality
hd

Video definition