A polynomial-time algorithm for reducing the number of variables in MAX SAT problem (Q1367267)
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 polynomial-time algorithm for reducing the number of variables in MAX SAT problem |
scientific article; zbMATH DE number 1063748
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for reducing the number of variables in MAX SAT problem |
scientific article; zbMATH DE number 1063748 |
Statements
A polynomial-time algorithm for reducing the number of variables in MAX SAT problem (English)
0 references
21 September 1997
0 references
maximum satisfiability
0 references
MAX SAT problem
0 references
0 references
