𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of Generalized Satisfiability Counting Problems

✍ Scribed by Nadia Creignou; Miki Hermann

Book ID
112252208
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
698 KB
Volume
125
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Complexity Index for Satisfiability Pr
A Complexity Index for Satisfiability Problems
✍ Boros, E.; Crama, Y.; Hammer, P. L.; Saks, M. πŸ“‚ Article πŸ“… 1994 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 531 KB
The Complexity of Planar Counting Proble
The Complexity of Planar Counting Problems
✍ Hunt, Harry B.; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Stearns, Richard E πŸ“‚ Article πŸ“… 1998 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 436 KB
Generalized satisfiability problems: min
Generalized satisfiability problems: minimal elements and phase transitions
✍ Nadia Creignou; HervΓ© DaudΓ© πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 263 KB

We develop a probabilistic model on the generalized satisΓΏability problems deΓΏned by Schaefer (in: Proceedings of the 10th STOC, San Diego, CA, USA, Association for Computing Machinery, New York, 1978, pp. 216 -226) for which the arity of the constraints is ΓΏxed in order to study the associated phas