![]() | ![]() |
2004 | ||
---|---|---|
3 | EE | Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich: Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theor. Comput. Sci. 329(1-3): 1-45 (2004) |
2003 | ||
2 | EE | Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich: Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. FCT 2003: 15-26 |
1 | EE | Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich: Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques Electronic Colloquium on Computational Complexity (ECCC) 10(030): (2003) |
1 | Amin Coja-Oghlan | [1] [2] [3] |
2 | Andreas Goerdt | [1] [2] [3] |
3 | André Lanka | [1] [2] [3] |