✦ LIBER ✦

Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems

✍ Scribed by Yamakami, Tomoyuki

Book ID: 119375295
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 376 KB
Volume: 461
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate counting for complex-weighte

Approximate counting for complex-weighted Boolean constraint satisfaction problems

✍ Tomoyuki Yamakami 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Complexity and Approximability of Quanti

Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems

✍ Harry B. Hunt III; Madhav V. Marathe; Richard E. Stearns 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 913 KB

Parameterized complexity of constraint s

Parameterized complexity of constraint satisfaction problems

✍ Dániel Marx 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 285 KB

The complexity of recursive constraint s

The complexity of recursive constraint satisfaction problems

✍ Victor W. Marek; Jeffrey B. Remmel 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 701 KB

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

The Relative Complexity of Approximate C

The Relative Complexity of Approximate Counting Problems

✍ Martin Dyer; Leslie Ann Goldberg; Catherine Greenhill; Mark Jerrum 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 295 KB