The relative complexity of approximate counting problems (Q1879247)

From MaRDI portal
Revision as of 04:16, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56323980, #quickstatements; #temporary_batch_1711504539957)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The relative complexity of approximate counting problems
scientific article

    Statements

    title
    The relative complexity of approximate counting problems (English)
    0 references
    author
    Leslie Ann Goldberg
    0 references
    Catherine Greenhill
    0 references
    Martin Dyer
    0 references
    Mark R. Jerrum
    0 references
    published in
    Algorithmica
    0 references
    publication date
    22 September 2004
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    2101908
    0 references
    zbMATH Keywords
    Computational complexity
    0 references
    OpenAlex ID
    W2177243619
    0 references
    Wikidata QID
    Q56323980
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1879247&oldid=33208593"
    Powered by MediaWiki