𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate counting for complex-weighted Boolean constraint satisfaction problems

✍ Scribed by Tomoyuki Yamakami

Book ID
119257781
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
429 KB
Volume
219
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Boolean constraint satisfaction: complex
Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights
✍ Peter Jonsson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 125 KB

A boolean constraint satisfaction problem consists of some ΓΏnite set of constraints (i.e., functions from 0=1-vectors to {0; 1}) and an instance of such a problem is a set of constraints applied to speciΓΏed subsets of n boolean variables. The goal is to ΓΏnd an assignment to the variables which satis