An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
On space-efficient algorithms for certain NP-complete problems
Theoretical Computer Science
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
New algorithms for exact satisfiability
Theoretical Computer Science
Algorithms for max hamming exact satisfiability
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The worst-case upper bound for exact 3-satisfiability with the number of clauses as the parameter
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 5.24 |
This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. The solutions are based on a recursive partitioning of the problem domain, and careful elimination of some of the branches along the search without actually checking them. The time complexity of the proposed algorithms is of the form O(2εn) for constant 0 ε 1, where n is the output size of the problem. In particular, such algorithms are presented for the Exact SAT and Exact Hitting Set problems (with ε = 0.3212), and for the Exact 3SAT problem (with ε= 0.2072). Both algorithms improve on previous ones proposed in the literature.