A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
A Probabilistic 3-SAT Algorithm Further Improved
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Theoretical advances in artificial immune systems
Theoretical Computer Science
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Foundations of r-contiguous matching in negative selection for anomaly detection
Natural Computing: an international journal
A tighter bound for counting max-weight solutions to 2SAT instances
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A new bound for an NP-hard subclass of 3-SAT using backdoors
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A full derandomization of schöning's k-SAT algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Solving connected dominating set faster than 2n
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Faster exact solving of SAT formulae with a low number of occurrences per variable
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An improved upper bound for SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
A Threshold for a Polynomial Solution of #2SAT
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 5.23 |
We slightly improve the pruning technique presented in Dantsin et al. (Theoret. Comput. Sci. 289 (2002) 69) to obtain an O*(1.473n) deterministic algorithm for 3-SAT.