on the complexity of finding tensor ranks

printable pdf

比利时vs摩洛哥足彩 ,
university of california san diego

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

math 278c: optimization and data science

prof. mohsen aliabadi

ucsd

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

february 15, 2023

3:00 pm

https://urldefense.com/v3/https://ucsd.zoom.us/j/94030298286?pwd=ttk1bi9qy1lis1vvbgdpmnvptxc3dz09;!!mih3wa!bt_ckwrzqwwdvyp5xmkcoy_6cv45-c-jifgwohwermp24ogrzrps9lpsx9vmhk7kpilfg1jdq9j_dq$
meeting id: 940 3029 8286
password: 278cwn23