𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constraint satisfaction — Algorithms and complexity analysis

✍ Scribed by Walter Hower

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
676 KB
Volume
55
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of constraint satisfactio
The complexity of constraint satisfaction revisited
✍ Alan K. Mackworth; Eugene C. Freuder 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 327 KB

Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence 59 (1993) 57-62. This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency alg

Soft constraint satisfaction (SCS) blind
Soft constraint satisfaction (SCS) blind channel equalization algorithms
✍ Oğuz Tanrikulu; Buyurman Baykal; Anthony G. Constantinides; Jonathon A. Chambers 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB

The constant modulus adaptive blind equalization algorithms presented in this paper are shown to correspond to an error performance surface which is much improved upon that of existing algorithms such as the wellknown constant modulus (or Godard) algorithm. Many undesirable local solutions (ULSs) ar

Algebra complexity problems involving gr
Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
✍ Steve Seif; Csaba Szabó 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 130 KB

In this paper, we connect the constraint satisfaction problem with other complexity problems, like the polynomial equivalence problem for combinatorial 0-simple semigroups, the graph retraction problem and the geometry problem. We show that every constraint satisfaction problem is polynomially equiv

On the parallel complexity of discrete r
On the parallel complexity of discrete relaxation in constraint satisfaction networks
✍ Simon Kasif 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 605 KB

## Constraint satisfaction networks have been shown to be a very useful tool for knowledge representation in Artificial Intelligence applications. These networks often utilize local constraint propagation techniques to achieve local consistency (consistent labeling in vision). Such methods have been