๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of recursive constraint satisfaction problems

โœ Scribed by Victor W. Marek; Jeffrey B. Remmel

Book ID
108054667
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
701 KB
Volume
161
Category
Article
ISSN
0168-0072

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

Resolution Complexity of Random Constrai
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
โœ Yong Gao; Joseph Culberson ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 97 KB

Let C 2,k,t n,cn be a random constraint satisfaction problem(CSP) of n binary variables, where c > 0 is a fixed constant and the cn constraints are selected uniformly and independently from all the possible k-ary constraints each of which contains exactly t tuples of the values as its restrictions.