On the complexity of the generalized MinRank problem (Q390388)

From MaRDI portal
Revision as of 05:25, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of the generalized MinRank problem
scientific article

    Statements

    title
    On the complexity of the generalized MinRank problem (English)
    0 references
    publication date
    8 January 2014
    0 references
    Mathematics Subject Classification ID
    13P10
    0 references
    68Q25
    0 references
    14M12
    0 references
    15A03
    0 references
    94A60
    0 references
    zbMATH DE Number
    6243369
    0 references
    zbMATH Keywords
    MinRank
    0 references
    Gröbner basis
    0 references
    determinantal
    0 references
    bi-homogeneous
    0 references
    structured algebraic systems
    0 references
    describes a project that uses
    Magma
    0 references
    Kronecker
    0 references
    OpenAlex ID
    W1985924702
    0 references
    arXiv ID
    1112.4411
    0 references
    cites work
    Q4234296
    0 references
    Q4474187
    0 references
    Q4317713
    0 references
    Q4660688
    0 references
    Q4941844
    0 references
    Q3325833
    0 references
    Q5462454
    0 references
    Q4660671
    0 references
    Q2763707
    0 references
    Q4428722
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q390388&oldid=35366613"
    Powered by MediaWiki