Printable PDF
Department of Mathematics,
University of California San Diego

****************************

Math 278C - Optimization and Data Science

Mohsen Aliabadi

UCSD

On the complexity of finding tensor ranks

Abstract:

The purpose of this talk is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $F$ is at most $k$ over the algebraic closure of $F$, where $k$ is a given positive integer. We estimate the arithmetic complexity of our algorithm. 

Host: Jiawang Nie

May 18, 2022

3:00 PM

https://ucsd.zoom.us/j/93696624146

Meeting ID: 936 9662 4146
Password: OPT2022SP

****************************