The relationship between the complexity classes PP and NPNP represents one of the most fundamental open problems in theoretical computer science. It is well established thatP⊆NP,P \subseteq NP,meaning
S3CMTF-opt shows the lowest time complexity and S3CMTF-base shows the lowest memory usage. For simplicity, we assume that all modes are of size I, of rank J, and an I × K matrix is coupled to one mode
