noc21-cs53-Lec02

Name: noc21-cs53-Lec02
Uploaded: 2023-12-04T00:54:42.421Z
Duration: 1 h 1 min 18 s
Channel: IIT Kanpur July 201
Description: Description: In this lecture, we define two non-uniform computational model - Arithmetic and Boolean Circuits. Discuss more complexity classes and their connection with lower bounds. Finally, we will proof the famous Polynomial Identity Lemma and discuss its application.

IIT Kanpur July 201

Dec 4, 2023

Description: In this lecture, we define two non-uniform computational model - Arithmetic and Boolean Circuits. Discuss more complexity classes and their connection with lower bounds. Finally, we will proof the famous Polynomial Identity Lemma and discuss its application.