Abstract
The determination of the optimal subdecomposition based on CP decomposition for high-order tensors is not straightforward because the rank-one tensors are not orthogonal. We show that this is equivalent to the weighted clique problem. Thus, it is NP-hard.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
