Sketching Algorithms for Max-DICUT and Other CSPs
Offered By: Simons Institute via YouTube
Course Description
Overview
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
On Quantum Linear Algebra for Machine Learning - Quantum ColloquiumSimons Institute via YouTube DataSketches: A Production Quality Sketching Library for Big Data Analysis
Databricks via YouTube On Quantum Linear Algebra for Machine Learning - IPAM at UCLA
Institute for Pure & Applied Mathematics (IPAM) via YouTube Streaming and Learning Algorithms - Session 7C
IEEE via YouTube Capacity Analysis of Vector Symbolic Architectures
Simons Institute via YouTube