Computing sparse permanents faster (Q1044712)

From MaRDI portal
Revision as of 14:30, 11 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing sparse permanents faster
scientific article

    Statements

    Computing sparse permanents faster (English)
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references

    Identifiers