The complexity of constraint satisfaction revisited (Q2675271): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics 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: Q4012214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: REF-ARF: A system for solving problems stated as procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parallel complexity of discrete relaxation in constraint satisfaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / 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: Arc consistency for factorable relations. / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(93)90170-g / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012694101 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
The complexity of constraint satisfaction revisited
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references