Hardness results for approximate hypergraph coloring
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Note: On the dynamic coloring of graphs
Discrete Applied Mathematics
A kolmogorov complexity proof of the lovász local lemma for satisfiability
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
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
Dynamic chromatic number of regular graphs
Discrete Applied Mathematics
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability
Theoretical Computer Science
| Hi-index | 0.05 |