Computing unsatisfiable k-SAT instances with few occurrences per variable
Theoretical Computer Science
Deciding relaxed two-colorability: a hardness jump
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A new lower bound of critical function for (k,s)-SAT
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 5.23 |