Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The complexity of approximating conservative counting CSPs. - MaRDI portal

The complexity of approximating conservative counting CSPs. (Q2957879)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of approximating conservative counting CSPs.
scientific article

    Statements

    author
    Xi Chen
    0 references
    Martin Dyer
    0 references
    Leslie Ann Goldberg
    0 references
    Pinyan Lu
    0 references
    Colin McQuillan
    0 references
    David Richerby
    0 references
    Mark R. Jerrum
    0 references
    publication date
    30 January 2017
    0 references
    zbMATH Keywords
    counting constraint satisfaction problem
    0 references
    approximation
    0 references
    complexity
    0 references
    title
    The complexity of approximating conservative counting CSPs. (English)
    0 references

    Identifiers

    zbMATH DE Number
    6678916
    0 references
    OpenAlex ID
    W2518351639
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2957879&oldid=37277196"
    Powered by MediaWiki