Frank Schädlich

According to our database, Frank Schädlich authored at least 4 papers between 2003 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen.

Frank Schädlich

PhD thesis, 2004

Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.

Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich

Theor. Comput. Sci., 2004

2003

Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques

Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich

Electron. Colloquium Comput. Complex., 2003

Certifying Unsatisfiability of Random 2<i>k</i>-SAT Formulas Using Approximation Techniques.

Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003