Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics
Reference52 articles.
1. Hiding satisfying assignments: Two are better than one;Achlioptas;Journal of Artificial intelligence,2005
2. D. Achlioptas, Y. Peres, The random k-SAT threshold is 2klog2−o(k), in: Proceedings of the 35th Annual Symposium on Theory of Computing (STOC'03), 2003, pp. 223–231
3. D. Achlioptas, F. Ricci-Tersenghi, On the solution-space geometry of random constraint satisfiability problems, in: Proceedings of the 38th Annual Symposium on Theory of Computing (STOC'06), 2006, pp. 130–139
4. Experiments on data reduction for optimal domination in networks;Alber;Annals of Operations Research,2006
5. A spectral technique for coloring random 3-colorable graphs;Alon;SIAM J. Computing,1997
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献