Generalizations of Matrix Multiplication for Solving the Light Bulb Problem
Offered By: Centre de recherches mathématiques - CRM via YouTube
Course Description
Overview
Explore a groundbreaking approach to solving the Light Bulb Problem in this conference talk from the Workshop on Tensors: Quantum Information, Complexity and Combinatorics. Delve into the history of this 30-year-old problem introduced by L. Valiant and its applications in data analysis, statistics, and learning theory. Examine the limitations of traditional algorithms and the breakthrough achieved by G. Valiant in 2012 using fast matrix multiplication. Learn about a novel method that replaces matrix multiplication with similar tensors of potentially lower rank, potentially leading to faster computation. Discover how a 4*4*4 tensor with rank 5 can outperform Strassen's algorithm when applied to previous approaches. Gain insights into the speaker's optimism for this new technique and understand the broader implications of using alternative tensors for solving various algorithmic problems beyond matrix multiplication.
Syllabus
Josh Alman: Generalizations of Matrix Multiplication can solve the Light Bulb Problem
Taught by
Centre de recherches mathématiques - CRM
Related Courses
مقدمة في علم الحاسوب والبرمجةMassachusetts Institute of Technology via Edraak Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer Computational Thinking using Python
Massachusetts Institute of Technology via edX Java: Algorithms
Codecademy Technical Interview Practice with Java
Codecademy