YoVDO

An Improved Line-Point Low-Degree Test for Polynomials Over Finite Fields - Lecture

Offered By: Institute for Advanced Study via YouTube

Tags

Theoretical Computer Science Courses Discrete Mathematics Courses Combinatorics Courses Polynomials Courses Finite Fields Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Attend a Computer Science/Discrete Mathematics Seminar featuring Prahladh Harsha from the Tata Institute of Fundamental Research discussing "An Improved Line-Point Low-Degree Test." Explore the latest advancements in low-degree testing for polynomials over finite fields, focusing on a robust test in the high-error regime for linear-sized fields. Learn about the resolution of a long-standing open question in the field, resulting in an O(d)-query robust test. Compare this new approach to previous results, including those by Polishchuk & Spielman, Arora & Sudan, and Raz & Safra. Delve into the main technical innovation: a novel bivariate analysis that leverages Hensel lifting to connect multivariate factorization with low-degree polynomial testing. Gain insights into the non-black-box application of this technique in the context of root-finding. Discover the collaborative efforts behind this research, involving Mrinal Kumar, Ramprasad Saptharishi, and Madhu Sudan.

Syllabus

am|Simonyi 101 and Remote Access


Taught by

Institute for Advanced Study

Related Courses

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax
离散数学概论 Discrete Mathematics Generality
Peking University via Coursera
Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam
Discrete Mathematics
Shanghai Jiao Tong University via Coursera