6 citations · 24 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 2 cited
Improved upper bounds for the rigidity of Kronecker products
Bohdan Kivva
The rigidity of a matrix for target rank is the minimum number of entries of that need to be changed in order to obtain a matrix of rank at most . At MFCS'77, Valian…
cs.DS2020
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS
Bohdan Kivva, Aaron Potechin
In this paper we show that simple semidefinite programs inspired by degree SOS can exactly solve the tensor nuclear norm, tensor decomposition, and tensor completion problems o…