Formula dissection: A parallel algorithm for constraint satisfaction
From MaRDI portal
Publication:931750
DOI10.1016/j.camwa.2007.07.002zbMath1149.68415OpenAlexW2044212376MaRDI QIDQ931750
John H. Reif, Deepak Sherlekar, Simon Kasif
Publication date: 26 June 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2007.07.002
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Local consistency in parallel constraint satisfaction networks, On the constraint length of random \(k\)-CSP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of recognizing polyhedral scenes
- Using rewriting rules for connection graphs to prove theorems
- Consistency in networks of relations
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Parallel concepts in graph theory
- Principles of Constraint Programming
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Hard examples for resolution
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- Planar Formulae and Their Uses
- Parallel Algorithms in Graph Theory: Planarity Testing
- On the Problem of Partitioning Planar Graphs
- Scene Labeling by Relaxation Operations
- A Proof Procedure Using Connection Graphs
- Parallelism in random access machines
- A Computing Procedure for Quantification Theory
