Most Tensor Problems Are NP-Hard (Q5395740): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60307003, #quickstatements; #temporary_batch_1717956202963 |
Created claim: DBLP publication ID (P1635): journals/jacm/HillarL13, #quickstatements; #temporary_batch_1731547958265 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/HillarL13 / rank | |||
Normal rank | |||
Latest revision as of 03:19, 14 November 2024
scientific article; zbMATH DE number 6258138
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Most Tensor Problems Are NP-Hard |
scientific article; zbMATH DE number 6258138 |
Statements
Most Tensor Problems Are NP-Hard (English)
0 references
17 February 2014
0 references
\#P-hardness
0 references
NP-hardness
0 references
numerical multilinear algebra
0 references
VNP-hardness
0 references
bivariate matrix polynomials
0 references
hyperdeterminants
0 references
nonnegative definite tensors
0 references
polynomial time approximation schemes
0 references
symmetric tensors
0 references
system of multilinear equations
0 references
tensor eigenvalue
0 references
tensor rank
0 references
tensor singular value
0 references
tensor spectral norm
0 references
undecidability
0 references
