A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
Authors:
- 1 June 1997
- journal article
- Published by Springer Nature in Science China Technological Sciences
- Vol. 40 (3) , 301-311
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the complexity of propositional knowledge base revision, updates, and counterfactualsArtificial Intelligence, 1992
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973