Author:
Goerdt Andreas,Lanka André
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Alon, N., Feige, U., Widgerson, A., Zuckerman, D.: Derandomized Graph Products. Computational Complexity 5, 60–75 (1995)
2. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colourable graphs. DIMACS TR 94-35 (1994)
3. LNCS;H. Chen,1996
4. Coja-Oghlan, A., Goerdt, A., Lanka, A.: Strong Refutation Heuristics for Random k-SAT. RANDOM, To appear (2004), http://www.tu-chemnitz.de/informatik/HomePages/TI/publikationen.php
5. Coja-Oghlan, A., Goerdt, A., Lanka, A., Schädlich, F.: Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theoretical Computer Science. (To appear)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献