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

A Complexity Index for Satisfiability Problems

โœ Scribed by Boros, E.; Crama, Y.; Hammer, P. L.; Saks, M.


Book ID
118177318
Publisher
Society for Industrial and Applied Mathematics
Year
1994
Tongue
English
Weight
531 KB
Volume
23
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Dichotomy Theorem for Maximum Generali
โœ N. Creignou ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 930 KB

We study the complexity of an infinite class of optimization satisfiability problems. Each problem is represented through a finite set, \(S\), of logical relations (generalizing the notion of clauses of bounded length). We prove the existence of a dichotomic classification for optimization satisfiab