Structural decompositions for problems with global constraints (Q272005): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MINION / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093462208 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.02467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5469338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree width and related hypergraph invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Methods for the Partner Units Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size Bounds and Query Plans for Relational Joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reasoning with global 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: Constraint satisfaction with succinctly specified relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed Guarded Decompositions for Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified theory of structural tractability for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Satisfaction / 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: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous matchings: Hardness and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating fractional hypertree width / 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: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable cases of the extended global cardinality constraint / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:24, 11 July 2024

scientific article
Language Label Description Also known as
English
Structural decompositions for problems with global constraints
scientific article

    Statements

    Structural decompositions for problems with global constraints (English)
    0 references
    0 references
    20 April 2016
    0 references
    tractability
    0 references
    global constraints
    0 references
    structural restrictions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers