Explore algebraic circuit complexity in this graduate-level lecture on computational complexity theory. Delve into topics such as algebraic complexity, algebraic circuits, division by zero, cost models, formulas, division, determinants, formula size, and NP. Learn from Ryan O'Donnell at Carnegie Mellon University as part of the Fall 2017 Course 15-855. Supplement your understanding with suggested readings from Arora--Barak Chapters 16.1. Gain advanced insights into this crucial area of computer science over the course of 1 hour and 20 minutes.
Overview
Syllabus
Introduction
Algebraic Complexity
Algebraic Circuits
Division by Zero
Cost Model
Compute
Formulas
Division
Determinant
Formula Size
NP
Taught by
Ryan O'Donnell
