YoVDO

Rigid Matrices from Rectangular PCPs

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Theoretical Computer Science Courses Thought Experiments Courses Matrix Theory Courses

Course Description

Overview

Explore the concept of rigid matrices derived from rectangular probabilistically checkable proofs (PCPs) in this 22-minute IEEE conference talk. Delve into the fundamentals of rigid matrices and low-rank matrices before examining various constructions. Investigate the role of PCPs in decision procedures and engage with a thought experiment. Learn about rectangular PCPs, prime and B prime concepts, and their implications. Gain insights from speakers Amey Bhangale, Prahladh Harsha, Orr Paradise, and Avishay Tal as they guide you through this complex topic, from introduction to conclusion.

Syllabus

Introduction
What are rigid matrices
Low rank matrices
Constructions
PCPs
Decision Procedure
Thought Experiment
Rectangular PCPs
Prime and B Prime
Primes
Conclusion


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
IEEE via YouTube
Computation in the Brain Tutorial - Part 2
IEEE via YouTube
Computation in the Brain - Part 1
IEEE via YouTube
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube
Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube