The expressive power of valued constraints: Hierarchies and collapses (Q959827): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.08.036 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases for Boolean co-clones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / 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: Q4336206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / 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: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Scaling Algorithm for Minimizing Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function minimization / 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: 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: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the expressive power of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable constraints on ordered domains / 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: Submodular functions and electrical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster strongly polynomial time algorithm for submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / 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: Classes of submodular constraints expressible by graph cuts / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.08.036 / rank
 
Normal rank

Latest revision as of 09:59, 10 December 2024

scientific article
Language Label Description Also known as
English
The expressive power of valued constraints: Hierarchies and collapses
scientific article

    Statements

    The expressive power of valued constraints: Hierarchies and collapses (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2008
    0 references
    valued constraint satisfaction
    0 references
    expressibility
    0 references
    max-closed cost functions
    0 references
    polymorphisms
    0 references
    feasibility polymorphisms
    0 references
    fractional polymorphisms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers