An efficient algorithm for a class of constraint satisfaction problems (Q1611994): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial graph-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / 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: Tractable constraints on ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic min-max problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic arc-consistency algorithm and its specializations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 16:16, 4 June 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for a class of constraint satisfaction problems
scientific article

    Statements

    An efficient algorithm for a class of constraint satisfaction problems (English)
    0 references
    28 August 2002
    0 references
    0 references
    feasibility checking
    0 references
    efficient algorithm
    0 references
    satisfiability
    0 references
    horn formula
    0 references
    graph coloring
    0 references