Most Tensor Problems Are NP-Hard (Q5395740)

From MaRDI portal
Revision as of 19:06, 9 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60307003, #quickstatements; #temporary_batch_1717956202963)
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

    title
    Most Tensor Problems Are NP-Hard (English)
    0 references
    author
    Christopher J. Hillar
    0 references
    Lek-Heng Lim
    0 references
    publication date
    17 February 2014
    0 references
    zbMATH Keywords
    \#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

    DOI
    10.1145/2512329
    0 references
    zbMATH DE Number
    6258138
    0 references
    OpenAlex ID
    W2079705627
    0 references
    arXiv ID
    0911.1393
    0 references
    Wikidata QID
    Q60307003
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5395740&oldid=34387424"
    Powered by MediaWiki