Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1051/ro/2015017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2305237467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576650 / 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: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for backtrack-bounded search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A backtracking-based algorithm for hypertree decomposition / 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: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized hypertree decompositions: NP-hardness and tractable variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing constraint satisfaction problems using database techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing optimal binary decision trees is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid backtracking bounded by tree-decomposition of constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: STR2: optimized simple tabular reduction for table constraints / 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: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition search for non-binary constraint satisfaction / rank
 
Normal rank

Latest revision as of 22:31, 11 July 2024

scientific article
Language Label Description Also known as
English
Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints
scientific article

    Statements

    Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2016
    0 references
    constraint satisfaction problems
    0 references
    generalized hypertree decomposition
    0 references
    compressed table constraints
    0 references
    0 references
    0 references

    Identifiers