Journal of the ACM· 2013Q1
Most Tensor Problems Are NP-Hard
- 1,146citations
- Q1SCImago
- 2013year
Short summary
Many fundamental problems involving tensors, the multidimensional generalization of matrices, are proven to be NP-hard, meaning they are computationally intractable for large inputs.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Computational Mathematics
Computational MathematicsMathematics