noc21-cs53-Lec02

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.