𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Equality Constraint Languages

✍ Scribed by Manuel Bodirsky; Jan Kára

Book ID
105914984
Publisher
Springer
Year
2007
Tongue
English
Weight
418 KB
Volume
43
Category
Article
ISSN
1433-0490

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

The counting complexity of group-definab
The counting complexity of group-definable languages
✍ V. Arvind; N.V. Vinodchandran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 166 KB

A group family is a countable family B = {Bn}n¿0 of ÿnite black-box groups, i.e., the elements of each group Bn are uniquely encoded as strings of uniform length (polynomial in n) and for each Bn the group operations are computable in time polynomial in n. In this paper we study the complexity of NP