An approximation trichotomy for Boolean \#CSP (Q972385)

From MaRDI portal
Revision as of 21:18, 2 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
An approximation trichotomy for Boolean \#CSP
scientific article

    Statements

    title
    An approximation trichotomy for Boolean \#CSP (English)
    0 references
    author
    Martin Dyer
    0 references
    Leslie Ann Goldberg
    0 references
    Mark R. Jerrum
    0 references
    publication date
    25 May 2010
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    68Q25
    0 references
    68T20
    0 references
    zbMATH DE Number
    5711904
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    combinatorial enumeration
    0 references
    computational complexity
    0 references
    constraint satisfaction problems
    0 references
    OpenAlex ID
    W1964923287
    0 references
    Wikidata QID
    Q56323828
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q972385&oldid=35171486"
    Powered by MediaWiki