What you will learn
-
None
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.
No Discussion Found
0.0
0 Reviews
Meet Your Instructor
About Instructor
VTU is one of the largest Technological Universities in India with 24 years of Tradition of excellence in Engineering & Technical Education, Research and Innovations. It came into existence in the year 1998 to cater the needs of Indian industries for trained technical manpower with practical experience and sound theoretical knowledge.
Free
-
Course Duration30 h 1 m 41 s
-
Course LevelAdvanced
-
Student Enrolled8
-
LanguageEnglish
This Course Includes
- 30 h 1 m 41 s Video Lectures
- 0 Quizzes
- 0 Assignments
- 0 Downloadable Resources
- Full Lifetime Access
- Certificate of Completion