Formula dissection: A parallel algorithm for constraint satisfaction (Q931750): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.camwa.2007.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044212376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scene Labeling by Relaxation Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of recognizing polyhedral scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Partitioning Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms in Graph Theory: Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using rewriting rules for connection graphs to prove theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof Procedure Using Connection Graphs / rank
 
Normal rank

Latest revision as of 11:46, 28 June 2024

scientific article
Language Label Description Also known as
English
Formula dissection: A parallel algorithm for constraint satisfaction
scientific article

    Statements

    Formula dissection: A parallel algorithm for constraint satisfaction (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2008
    0 references
    Boolean formula
    0 references
    combinatorial search
    0 references
    parallel algorithm
    0 references
    graph
    0 references
    dissection
    0 references

    Identifiers