Frank Schädlich

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2004
b1		Frank Schädlich: Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen. Chemnitz University of Technology 2004, pp. 1-194
j1		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
c1		Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich: Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. FCT 2003: 15-26
i1		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)

Coauthor Index

Last update Sat May 25 07:03:51 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page