A polynomial-time algorithm for reducing the number of variables in MAX SAT problem (Q1367267): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of propositional knowledge base revision, updates, and counterfactuals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4133656 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3812268 / rank | |||
Normal rank | |||
Revision as of 17:59, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for reducing the number of variables in MAX SAT problem |
scientific article |
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
