Constraint Satisfaction Parameterized by Solution Size (Q3012823): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone monadic SNP and constraint satisfaction / 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: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing of Min Ones Problems: A Dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Losing Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT / rank
 
Normal rank

Latest revision as of 06:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Constraint Satisfaction Parameterized by Solution Size
scientific article

    Statements

    Constraint Satisfaction Parameterized by Solution Size (English)
    0 references
    0 references
    0 references
    6 July 2011
    0 references
    0 references
    0 references