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

From MaRDI portal
Created claim: Wikidata QID (P12): Q56323825, #quickstatements; #temporary_batch_1712190744730
ReferenceBot (talk | contribs)
Changed an Item
 
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

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