Derandomization from Algebraic Hardness - Treading the Borders

Derandomization from Algebraic Hardness - Treading the Borders

Explore a conference talk on derandomization techniques in computational complexity theory, focusing on the intersection of algebraic hardness and hitting set construction. Delve into the main theorem presented, its consequences for bootstrapping, and the novel generator described. Gain insights into lower bounds, algebraic circuits, and the reconstruction process for polynomials. Follow the speakers as they navigate the borders of current research in this field, offering a comprehensive overview of recent advancements and their implications for computational complexity theory.