Johannes Fichte: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Fichte (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Johannes Fichte (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 8: | Zeile 8: | ||
|Email=johannes.fichte@gmail.com | |Email=johannes.fichte@gmail.com | ||
|Bild=By sarameister23-3.jpg | |Bild=By sarameister23-3.jpg | ||
|Info=My work interests in computational complexity theory and its applications. In particular I work on the understanding of the gap between intractability (strong theoretical evidence) and practical efficient solutions (industrial/structured setting). I consider the boolean satisfiablity problem (SAT), answer-set programming (ASP), and related formalisms. | |||
I am happy to supervise theses of motivated students in topics related to my research area. If you have ideas or questions regarding possible topics, please contact me. | |||
|Info EN=My work interests in computational complexity theory and its applications. In particular I work on the understanding of the gap between intractability (strong theoretical evidence) and practical efficient solutions (industrial/structured setting). I consider the boolean satisfiablity problem (SAT), answer-set programming (ASP), and related formalisms. | |Info EN=My work interests in computational complexity theory and its applications. In particular I work on the understanding of the gap between intractability (strong theoretical evidence) and practical efficient solutions (industrial/structured setting). I consider the boolean satisfiablity problem (SAT), answer-set programming (ASP), and related formalisms. | ||
Version vom 25. April 2018, 11:02 Uhr
Dr. Johannes K. Fichte
Wissenschaftlicher Mitarbeiter Wissensverarbeitung
My work interests in computational complexity theory and its applications. In particular I work on the understanding of the gap between intractability (strong theoretical evidence) and practical efficient solutions (industrial/structured setting). I consider the boolean satisfiablity problem (SAT), answer-set programming (ASP), and related formalisms.
I am happy to supervise theses of motivated students in topics related to my research area. If you have ideas or questions regarding possible topics, please contact me.
