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

On the constraint length of random\(k\)-CSP

โœ Scribed by Zhou, Guangyan; Gao, Zongsheng; Liu, Jun

Book ID
125363138
Publisher
Springer US
Year
2014
Tongue
English
Weight
196 KB
Volume
30
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The approximability of MAX CSP with fixe
The approximability of MAX CSP with fixed-value constraints
โœ Deineko, Vladimir; Jonsson, Peter; Klasson, Mikael; Krokhin, Andrei ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 321 KB

In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximize the number (or the total weight, for the weig