Prepare for a new career with $100 off Coursera Plus
Gear up for jobs in high-demand fields: data analytics, digital marketing, and more.
ABOUT THE COURSE: This is a course on Boolean Circuit Complexity. In this course we study the Boolean circuit model of computation. We prove upper and lower bounds on circuit resources such as depth and size. The course is entirely mathematical, and a good level of mathematical maturity is essential. Prior knowledge of discrete mathematics, probability and basic algebra are prerequisites for this course. The course is intended for students who wish to pursue research in theoretical computer science. INTENDED AUDIENCE: Computer Science advanced undergraduate and postgraduate student interested in theoretical computer sciencePREREQUISITES: Basic undergraduate course in Theory of Computation and Algorithms. Undergraduate algebra and discrete mathematics.