Homepage of Matthias
P. Krieger
Mathematics and computer science graduate
of Johann Wolfgang
Goethe-Universität Frankfurt
Email: mkrieger _at_ cs.uni-frankfurt.de
Research Interests
- Computational complexity (in particular circuit complexity)
- Software specification
- Applications of SAT solvers
You can download my Diplom
thesis "Some Restricted Circuit Classes that Can Be as Inefficient as
DNFs" here.
Publications
On the Incompressibility
of Monotone DNFs. In Liskiewicz, M., Reischuk, R., editors:
Fundamentals of Computation Theory.
Volume 3623 of Lecture Notes
in
Computer Science, Springer 2005, pp. 32-43 [pdf
© Springer-Verlag]
Journal version of this paper:
On
the Incompressibility of Monotone DNFs. Theory
of Computing Systems 41 (2007), pp. 211-231 [pdf
© Springer-Verlag]