A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Satisfiability - Algorithms and Logic
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
An improved exact algorithm for the domatic number problem
Information Processing Letters
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Determining a singleton attractor of an AND/OR Boolean network in O (1.587n) time
Information Processing Letters
Finding a Periodic Attractor of a Boolean Network
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A Threshold for a Polynomial Solution of #2SAT
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We improve an upper bound by Hirsch on a deterministic algorithm for solving general CNF satisfiability problem. With more detail analysis of Hirsch's algorithm, we give some improvements, by which we can prove an upper bound $\tilde{\mathcal{O}}(1.234^{m})$ w.r.t. the number m of input clauses, which improves Hirsch's bound $\tilde{\mathcal{O}}(1.239^{m})$.