DIMACS CCICADA
DIMACS CCICADA
  • Видео 515
  • Просмотров 156 901
Nutan Limaye: Algebraic complexity - Part 3
Nutan Limaye, IT University of Copenhagen, presents a three-part tutorial on algebraic Complexity at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 3.
Description: In this tutorial on Algebraic Complexity, we will start by introducing the basics of algebraic computation. We will present the broad research themes being explored actively in this research area. We will study the techniques used in proving the recent state-of-the-art lower bounds for constant-depth algebraic circuits. In fact, we will also study all the proof details! We will end with some promising future research directions.
Link to workshop webpage: dim...
Просмотров: 117

Видео

Nutan Limaye: Algebraic complexity - Part 2
Просмотров 672 месяца назад
Nutan Limaye, IT University of Copenhagen, presents a three-part tutorial on algebraic Complexity at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 2. Description: In this tutorial on Algebraic Complexity, we will start by introducing the basics of algebraic computation. We will present the broad research themes being expl...
Nutan Limaye: Algebraic Complexity - Part 1
Просмотров 5042 месяца назад
Nutan Limaye, IT University of Copenhagen, presents a three-part tutorial on algebraic Complexity at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 1. Description: In this tutorial on Algebraic Complexity, we will start by introducing the basics of algebraic computation. We will present the broad research themes being expl...
Swastik Kopparty: Error-correcting Codes - Part 3
Просмотров 922 месяца назад
Swastik Kopparty, University of Toronto, presents a three-part tutorial on error-correcting codes at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 3. Description: We will start with a quick introduction to codes and some central algebraic and combinatorial families of error-correcting codes. Then we will get a taste of co...
Swastik Kopparty: Error-correcting Codes - 2
Просмотров 672 месяца назад
Swastik Kopparty, University of Toronto, presents a three-part tutorial on error-correcting codes at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 2. Description: We will start with a quick introduction to codes and some central algebraic and combinatorial families of error-correcting codes. Then we will get a taste of co...
Swastik Kopparty: Error-correcting codes - Part 1
Просмотров 1992 месяца назад
Swastik Kopparty, University of Toronto, presents a three-part tutorial on error-correcting codes at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 1. Description: We will start with a quick introduction to codes and some central algebraic and combinatorial families of error-correcting codes. Then we will get a taste of co...
Roei Tell: Derandomization - Part 3
Просмотров 702 месяца назад
Roei Tell, University of Toronto, presents a three-part tutorial on derandomization at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 3. Description: The focus of this tutorial is derandomization, and in particular new developments in hardness vs randomness. We will first introduce textbook results, such as the reconstruct...
Keynote Presentation: Ryan Williams - Circuit Complexity from Circuit Analysis Algorithms
Просмотров 1702 месяца назад
Ryan Williams, Massachusetts Institute of Technology, delivers his keynote presentation, "Circuit Complexity from Circuit Analysis Algorithms", at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. Link to workshop webpage: dimacs.rutgers.edu/events/details?eID=2785
Lijie Chen: C^3 Locally Testable Code
Просмотров 2712 месяца назад
Lijie Chen, University of California-Berkeley, speaks on C^3 locally testable code at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. Link to workshop webpage: dimacs.rutgers.edu/events/details?eID=2785
Rahul Ilango: Metacomplexity - Recap
Просмотров 632 месяца назад
Rahul Ilango, Massachusetts Institute of Technology, presents a three-part tutorial on metacomplexity at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is a short recap. Description: In this tutorial we will give an introduction to the area of metacomplexity. No prior background is assumed, and we will start with an overview of th...
Roei Tell: Derandomization - Part 2
Просмотров 422 месяца назад
Roei Tell, University of Toronto, presents a three-part tutorial on derandomization at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 2. Description: The focus of this tutorial is derandomization, and in particular new developments in hardness vs randomness. We will first introduce textbook results, such as the reconstruct...
Roei Tell: Derandomization - Part 1
Просмотров 1252 месяца назад
Roei Tell, University of Toronto, presents a three-part tutorial on derandomization at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 1. Description: The focus of this tutorial is derandomization, and in particular new developments in hardness vs randomness. We will first introduce textbook results, such as the reconstruct...
Rahul Ilango: Metacomplexity - Part 3
Просмотров 652 месяца назад
Rahul Ilango, Massachusetts Institute of Technology, presents a three-part tutorial on metacomplexity at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 3. Description: In this tutorial we will give an introduction to the area of metacomplexity. No prior background is assumed, and we will start with an overview of the major...
Rahul Ilango: Metacomplexity - Part 2
Просмотров 1062 месяца назад
Rahul Ilango, Massachusetts Institute of Technology, presents a three-part tutorial on metacomplexity at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 2. Description: In this tutorial we will give an introduction to the area of metacomplexity. No prior background is assumed, and we will start with an overview of the major...
Rahul Ilango: Metacomplexity - Part 1
Просмотров 2952 месяца назад
Rahul Ilango, Massachusetts Institute of Technology, presents a three-part tutorial on metacomplexity at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 1. Description: In this tutorial we will give an introduction to the area of metacomplexity. No prior background is assumed, and we will start with an overview of the major...
Bird's View Lecture 4: Barriers for Fine-Grained Reductions
Просмотров 532 месяца назад
Bird's View Lecture 4: Barriers for Fine-Grained Reductions
Lecture 11: Hardness of Approximation in P, Part 2
Просмотров 192 месяца назад
Lecture 11: Hardness of Approximation in P, Part 2
Lecture 11: Hardness of Approximation in P, Part 1
Просмотров 492 месяца назад
Lecture 11: Hardness of Approximation in P, Part 1
Lecture 10: SETH-Hardness of LCS
Просмотров 242 месяца назад
Lecture 10: SETH-Hardness of LCS
Bird's View Lecture 3: Fine-Grained Lower Bounds for Dynamic Graph Problems
Просмотров 692 месяца назад
Bird's View Lecture 3: Fine-Grained Lower Bounds for Dynamic Graph Problems
Lecture 9: Orthogonal Vectors Hypothesis
Просмотров 432 месяца назад
Lecture 9: Orthogonal Vectors Hypothesis
Lecture 8: Lower Bounds under ETH and SETH
Просмотров 362 месяца назад
Lecture 8: Lower Bounds under ETH and SETH
Lecture 7: Algorithms for k-SAT
Просмотров 232 месяца назад
Lecture 7: Algorithms for k-SAT
Bird's View Lecture 2: APMF vs. APSP
Просмотров 122 месяца назад
Bird's View Lecture 2: APMF vs. APSP
Lecture 6: APSP-Hardness of Zero Triangle
Просмотров 332 месяца назад
Lecture 6: APSP-Hardness of Zero Triangle
Lecture 13: Recent Developments in Fine-Grained Complexity
Просмотров 582 месяца назад
Lecture 13: Recent Developments in Fine-Grained Complexity
Lecture 5: APSP-Hardness of Negative Triangle Detection
Просмотров 402 месяца назад
Lecture 5: APSP-Hardness of Negative Triangle Detection
Lecture 4: APSP Hypothesis
Просмотров 712 месяца назад
Lecture 4: APSP Hypothesis
Bird's View Lecture 1: 3SUM-Hardness of Geometric Problems
Просмотров 502 месяца назад
Bird's View Lecture 1: 3SUM-Hardness of Geometric Problems
Lecture 3: 3SUM-Hardness of Convolution 3SUM and Triangle Listing
Просмотров 902 месяца назад
Lecture 3: 3SUM-Hardness of Convolution 3SUM and Triangle Listing