The Complexity of General-Valued CSPs (Q5283238): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1502.07327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The collapse of the bounded width hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustly Solvable Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Decay and Tractability of CSPs. / 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: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conservative constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Theory of Complexity for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Characterisation of Complexity for Valued Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supermodular functions and the complexity of MAX CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of constraints. An overview of current research themes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximability of MAX CSP with fixed-value constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems / 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: A Galois Connection for Weighted (Relational) Clones of Infinite Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Optimization Problems through Hypergraph-Based Structural Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every 2-CSP allows nontrivial approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / 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: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Three-valued MAX CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min CSP on Four Elements: Moving beyond Submodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the Maximum Solution Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectiveness of Structural Restrictions for Hybrid CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Linear Programming for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of conservative valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Properties of Valued Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sherali-Adams Relaxations for Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finite-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Sherali--Adams Relaxations for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2613504727 / rank
 
Normal rank

Latest revision as of 09:23, 30 July 2024

scientific article; zbMATH DE number 6750881
Language Label Description Also known as
English
The Complexity of General-Valued CSPs
scientific article; zbMATH DE number 6750881

    Statements

    The Complexity of General-Valued CSPs (English)
    0 references
    0 references
    0 references
    0 references
    21 July 2017
    0 references
    valued constraint satisfaction problem
    0 references
    complexity
    0 references
    dichotomy
    0 references
    fractional polymorphism
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers