DIMACS CCICADA
DIMACS CCICADA
  • 515
  • 151 831
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: dimacs.rutgers.edu/events/details?eID=2785
มุมมอง: 89

วีดีโอ

Nutan Limaye: Algebraic complexity - Part 2
มุมมอง 5528 วันที่ผ่านมา
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
มุมมอง 43428 วันที่ผ่านมา
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
มุมมอง 7628 วันที่ผ่านมา
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
มุมมอง 5328 วันที่ผ่านมา
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
มุมมอง 17028 วันที่ผ่านมา
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
มุมมอง 6128 วันที่ผ่านมา
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
มุมมอง 11228 วันที่ผ่านมา
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
มุมมอง 16728 วันที่ผ่านมา
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
มุมมอง 4328 วันที่ผ่านมา
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
มุมมอง 2928 วันที่ผ่านมา
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
มุมมอง 9928 วันที่ผ่านมา
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
มุมมอง 3328 วันที่ผ่านมา
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
มุมมอง 5328 วันที่ผ่านมา
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
มุมมอง 21228 วันที่ผ่านมา
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
มุมมอง 40หลายเดือนก่อน
Bird's View Lecture 4: Barriers for Fine-Grained Reductions
Lecture 11: Hardness of Approximation in P, Part 2
มุมมอง 13หลายเดือนก่อน
Lecture 11: Hardness of Approximation in P, Part 2
Lecture 11: Hardness of Approximation in P, Part 1
มุมมอง 34หลายเดือนก่อน
Lecture 11: Hardness of Approximation in P, Part 1
Lecture 10: SETH-Hardness of LCS
มุมมอง 12หลายเดือนก่อน
Lecture 10: SETH-Hardness of LCS
Bird's View Lecture 3: Fine-Grained Lower Bounds for Dynamic Graph Problems
มุมมอง 57หลายเดือนก่อน
Bird's View Lecture 3: Fine-Grained Lower Bounds for Dynamic Graph Problems
Lecture 9: Orthogonal Vectors Hypothesis
มุมมอง 28หลายเดือนก่อน
Lecture 9: Orthogonal Vectors Hypothesis
Lecture 8: Lower Bounds under ETH and SETH
มุมมอง 25หลายเดือนก่อน
Lecture 8: Lower Bounds under ETH and SETH
Lecture 7: Algorithms for k-SAT
มุมมอง 15หลายเดือนก่อน
Lecture 7: Algorithms for k-SAT
Bird's View Lecture 2: APMF vs. APSP
มุมมอง 8หลายเดือนก่อน
Bird's View Lecture 2: APMF vs. APSP
Lecture 6: APSP-Hardness of Zero Triangle
มุมมอง 24หลายเดือนก่อน
Lecture 6: APSP-Hardness of Zero Triangle
Lecture 13: Recent Developments in Fine-Grained Complexity
มุมมอง 47หลายเดือนก่อน
Lecture 13: Recent Developments in Fine-Grained Complexity
Lecture 5: APSP-Hardness of Negative Triangle Detection
มุมมอง 33หลายเดือนก่อน
Lecture 5: APSP-Hardness of Negative Triangle Detection
Lecture 4: APSP Hypothesis
มุมมอง 60หลายเดือนก่อน
Lecture 4: APSP Hypothesis
Bird's View Lecture 1: 3SUM-Hardness of Geometric Problems
มุมมอง 33หลายเดือนก่อน
Bird's View Lecture 1: 3SUM-Hardness of Geometric Problems
Lecture 3: 3SUM-Hardness of Convolution 3SUM and Triangle Listing
มุมมอง 65หลายเดือนก่อน
Lecture 3: 3SUM-Hardness of Convolution 3SUM and Triangle Listing