Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
An improved Õ(1.234m)-time deterministic algorithm for SAT
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
Hi-index | 0.00 |