Johannes Fichte: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Fichte (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Sebastian Rudolph (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| (Eine dazwischenliegende Version von einem anderen Benutzer wird nicht angezeigt) | |||
| Zeile 4: | Zeile 4: | ||
|Akademischer Titel=Dr. | |Akademischer Titel=Dr. | ||
|Stellung=Wissenschaftlicher Mitarbeiter | |Stellung=Wissenschaftlicher Mitarbeiter | ||
|Ehemaliger= | |Ehemaliger=1 | ||
|Telefon=+49 351 463 43548 | |Telefon=+49 351 463 43548 | ||
|Email=johannes.fichte@tu-dresden.de | |Email=johannes.fichte@tu-dresden.de | ||
|Bild=Photo1.jpg | |Bild=Photo1.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 satisfiability problem (SAT), answer-set programming (ASP), and related formalisms.<br/> | |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 satisfiability problem (SAT), answer-set programming (ASP), and related formalisms.<br/><br/> | ||
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.<br/> | 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.<br/> | ||
|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 satisfiability problem (SAT), answer-set programming (ASP), and related formalisms.<br/> | |||
You can also find details on the faculty web page [https://tu-dresden.de/ing/informatik/ki/krr/die-professur/staff/dr-johannes-k-fichte]. | |||
|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 satisfiability problem (SAT), answer-set programming (ASP), and related formalisms.<br/><br/> | |||
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.<br/> | 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.<br/> | ||
You can also find details on the faculty web page [https://tu-dresden.de/ing/informatik/ki/krr/die-professur/staff/dr-johannes-k-fichte]. | |||
|DBLP=http://dblp.uni-trier.de/pers/hd/f/Fichte:Johannes_Klaus | |DBLP=http://dblp.uni-trier.de/pers/hd/f/Fichte:Johannes_Klaus | ||
|Google Scholar=https://scholar.google.de/citations?user=-yhf134AAAAJ&hl=en | |Google Scholar=https://scholar.google.de/citations?user=-yhf134AAAAJ&hl=en | ||
Aktuelle Version vom 12. Oktober 2021, 15:38 Uhr
Dr. Johannes K. Fichte
Ehemaliges Mitglied
- Ehemals Wissenschaftlicher Mitarbeiter
