YoVDO

Sketching Algorithms for Max-DICUT and Other CSPs

Offered By: Simons Institute via YouTube

Tags

Algorithm Design Courses Space Complexity Courses Constraint Satisfaction Problems Courses Sketching Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the Maximum Directed Cut (Max-DICUT) problem and its significance in Constraint Satisfaction Problems (CSPs) through this one-hour lecture. Delve into sketching algorithms and lower bounds for Max-DICUT across various space regimes, and discover how these concepts extend to general CSPs. Learn about the challenges of estimating the largest directed cut in a given graph and understand its implications in the streaming setting. Gain insights into open problems in this field and their potential impact on algorithm design. This talk, presented by Santhoshini Velusamy from Toyota Technological Institute at Chicago, offers a comprehensive look at cutting-edge research in graph theory and computational complexity.

Syllabus

Sketching Algorithms for Max-DICUT and other CSPs


Taught by

Simons Institute

Related Courses

数据结构与算法第二部分 | Data Structures and Algorithms Part 2
Peking University via edX
Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam
The Complete Data Structures and Algorithms Course in Python
Udemy
Computational Complexity
IIT Hyderabad via Swayam
Introduction to Algorithms Course (How To)
Treehouse