The Complexity of Boolean Matrix Root Computation (Q3082929)

From MaRDI portal
Revision as of 00:40, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Boolean Matrix Root Computation
scientific article

    Statements

    title
    The Complexity of Boolean Matrix Root Computation (English)
    0 references
    publication date
    18 March 2011
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C20
    0 references
    05C60
    0 references
    15B36
    0 references
    20M99
    0 references
    zbMATH DE Number
    5867689
    0 references
    author
    Martin Kuetz
    0 references
    OpenAlex ID
    W4230970195
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3082929&oldid=32431522"
    Powered by MediaWiki