Bipartite Edge Coloring in $O(\Delta m)$ Time
SIAM Journal on Computing
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Regular Random k-SAT: Properties of Balanced Formulas
Journal of Automated Reasoning
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Journal of Automated Reasoning
From spin glasses to hard satisfiable formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
How Hard is a Commercial Puzzle: the Eternity II Challenge
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Generating hard SAT/CSP instances using expander graphs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
| Hi-index | 0.00 |