Binarisation for Valued Constraint Satisfaction Problems (Q5371026): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On digraph coloring problems and treewidth duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary vs. non-binary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms / 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 wonderland of reflections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3169431 / 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: A Simple Algorithm for Mal'tsev Constraints / 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: Graphs of relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finer reduction of constraint problems to digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715675 / 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: The expressive power of valued constraints: Hierarchies and collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / 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 Valued Constraint Languages of Infinite Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy for minimum cost graph homomorphisms / 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 Dichotomy of Minimum Cost Homomorphism Problems for Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew Bisubmodularity and Valued CSPs / 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: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maltsev digraphs have a majority polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of General-Valued 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: Bounded width problems and algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems for weakly symmetric operations / 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: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715726 / 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: Extensions of the Minimum Cost Homomorphism Problem / 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: The expressive power of binary submodular functions / rank
 
Normal rank

Revision as of 14:28, 14 July 2024

scientific article; zbMATH DE number 6797248
Language Label Description Also known as
English
Binarisation for Valued Constraint Satisfaction Problems
scientific article; zbMATH DE number 6797248

    Statements

    Binarisation for Valued Constraint Satisfaction Problems (English)
    0 references
    24 October 2017
    0 references
    discrete optimization
    0 references
    valued constraint satisfaction problems
    0 references
    polymorphisms
    0 references
    fractional polymorphisms
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references