Takunari Miyazaki
Title: On the complexity of MIN-RANK and its applications
Speaker: Takunari Miyazaki, Trinity College
Abstract: The problem of finding a low-rank linear combination of matrices is a fundamental problem in linear algebra. Its decision version, called MIN-RANK, is also an important subject in computational complexity theory. In this talk, I will discuss MIN-RANK’s fundamental properties and highlight its various roles in cryptography.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Additional Questions?
If you have additional questions, feel free to reach out to a maintainer / contributor on the contact page.
