Christopher Hillar

1. Most tensor problems are NP-hard
   2009/11/07 by Christopher J. Hillar, Christopher Hillar, Lek-Heng Lim +3 · 53 citations
   Computer Science · Mathematics · #Computational Complexity (cs.CC) #F.2 #F.2.1 #FOS: Computer and information sciences #FOS: Mathematics #G.1.2 #G.1.3 #G.1.5 #G.1.6 #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical Methods and Algorithms #Tensor decomposition and applications #cs.CC #cs.NA #math.NA