Most Tensor Problems Are NP-Hard (Q5395740)

From MaRDI portal
Revision as of 19:30, 23 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers