The complexity of weighted and unweighted \(\#\)CSP (Q414939): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mark R. Jerrum / rank
Normal rank
 
Property / author
 
Property / author: Mark R. Jerrum / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134600856 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56323825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted Boolean \#CSP with mixed signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation trichotomy for Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity dichotomy for hypergraph partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting homomorphisms to directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:17, 5 July 2024

scientific article
Language Label Description Also known as
English
The complexity of weighted and unweighted \(\#\)CSP
scientific article

    Statements

    The complexity of weighted and unweighted \(\#\)CSP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    counting
    0 references
    constraint satisfaction
    0 references
    complexity theory
    0 references
    0 references
    0 references