List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Certifying unsatisfiability of random 2k-SAT formulas using approximation techniques. Lecture Notes in Computer Science | 2010-04-20 | Paper |
| Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT Theoretical Computer Science | 2005-02-09 | Paper |
Research outcomes over time
This page was built for person: Frank Schädlich
