Polynomial Identity Testing via Optimization: algorithms for the null-cone problem and orbit closure intersection
Abstract
Date
Mar 28, 2019 10:45 AM — 11:30 AM
Location
International Centre for Theoretical Sciences, Bangalore, India
In this talk we will see recent optimization based algorithms for the null-cone problem and the orbit closure intersection problem for the left-right action, and how these problems from invariant theory relate to a Polynomial Identity Testing for a restricted class of arithmetic circuits.
Joint work with Zeyuan-Allen Zhu, Ankit Garg, Yuanzhi Li and Avi Wigderson
Rafael Oliveira
Assistant Professor of Computer Science
My research interests include complexity theory, algebra, algebraic geometry, commutative algebra, invariant theory, representation theory, derandomization.
