Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1012.5659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation resistant predicates from pairwise independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Mal'tsev Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted and unweighted \(\#\)CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / 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: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Results on the Algebraic Approach to the CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of counting CSP with complex weights / 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: A Complete Dichotomy Rises from the Capture of Vanishing Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for Holant Problems with a Function on Domain Size 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Hardness for Approximate Coloring / 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: An Effective Dichotomy for the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for Partition Functions with Mixed Signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new line of attack on the dichotomy conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in Algebraic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations with structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Round Any CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP gaps and reductions in the lasserre hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2567588342 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
scientific article

    Statements

    Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (English)
    0 references
    0 references
    0 references
    0 references
    21 December 2016
    0 references
    constraint satisfaction problem
    0 references
    counting problems
    0 references
    complexity dichotomy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers