- Schedule of Classes - June 25, 2020 7:14PM EDT
- Course Catalog - June 25, 2020 7:15PM EDT
Course information provided by the Courses of Study 2019-2020.
This is an advanced Ph.D.-level seminar on special topics in algorithms. Recent papers in a selected research area will be read and presented. Topic for Spring 2020: the geometry of polynomials and its algorithmic applications. Sub-topics include the method of interlacing families and its applications to the Kadison-Singer problem and to constructing Ramanujan graphs; completely log-concave polynomials and their applications to sampling and counting problems.
When Offered Spring.
Permission Note Enrollment limited to: MS and Ph.D. students. Undergrad and M.Eng. by permission of instructor.
Prerequisites/Corequisites Prerequisite: CS 6820.
Regular Academic Session.
Credits and Grading Basis
1 Credit Sat/Unsat(Satisfactory/Unsatisfactory)
Class Number & Section Details
- W Bill and Melinda Gates Hll G15
- Jan 21 - May 5, 2020
Instruction Mode: Hybrid - Online & In Person
Disabled for this roster.