A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications |
scientific article; zbMATH DE number 5823282
- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications |
scientific article; zbMATH DE number 5823282 |
|
Statements
A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (English)
0 references
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application (English)
0 references
21 November 2012
0 references
7 December 2010
0 references
MaxSAT
0 references
lower bound
0 references
2-satisfiable
0 references
fixed parameter tractable
0 references
kernel
0 references
0 references
0 references
0.9993278
0 references
0.9208399
0 references
0.9185473
0 references
0.91530013
0 references
0.9128448
0 references
0.91253567
0 references
0.91253567
0 references
0.9120272
0 references
