Quelltext der Seite Johannes Fichte

{{Mitarbeiter
|Vorname=Johannes K.
|Nachname=Fichte
|Akademischer Titel=Dr.
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=1
|Telefon=+49 351 463 43548
|Email=johannes.fichte@tu-dresden.de
|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/><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].
|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/>

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
|Google Scholar=https://scholar.google.de/citations?user=-yhf134AAAAJ&hl=en
|Publikationen anzeigen=0
|Abschlussarbeiten anzeigen=0
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Answer Set Programming
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Constraint Satisfaction Problems
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Logic and Decision Procedures
}}