Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
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!
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
3-coloring in time O (1.3289n)
Journal of Algorithms
Improving efficiency of 3-SAT-solving tile systems
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |