2022 Fall

COMPSCI 294 214 - LEC 214

Special Topics

Efficient Algorithms and Computational Intractability in Statistics

Prasad Raghavendra

Aug 24, 2022 - Dec 09, 2022

Tu, Th

11:00 am - 12:29 pm

Soda 310

Class #:33014

Units: 3

Instruction Mode: In-Person Instruction

Offered through Electrical Engineering and Computer Sciences

Current Enrollment

Total Open Seats: 16

Enrolled: 29

Waitlisted: 0

Capacity: 45

Waitlist Max: 0

No Reserved Seats

Hours & Workload

1 to 3 hours of instructor presentation of course materials per week, and 2 to 11 hours of outside work hours per week.

Course Catalog Description

Topics will vary from semester to semester. See Computer Science Division announcements.

Description: In this course, we will explore the tractability of computational problems arising in statistics. This exploration will include both the design of efficient (polynomial-time) algorithms for some of these problems, and providing conditional evidence of computational intractability of others. (see the website: http://people.eecs.berkeley.edu/~prasad/fall2022.html for more details)

Class Notes

This class requires instructor consent. Interested student can find a sign up form on this webpage: http://people.eecs.berkeley.edu/~prasad/fall2022.html

*Note: Permission codes for undergrad students will not be provided to the professor until August 1st to ensure grad students have th.. show more