Frank Schädlich

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.
Theor. Comput. Sci., 2004

2003
Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques
Electronic Colloquium on Computational Complexity (ECCC), 2003

Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003


  Loading...