1955 – 2005
Clemens Lautemann (1955–2005) was a German mathematician and theoretical computer scientist known for his contributions to computational complexity theory and finite model theory. His work bridged mathematical logic and computer science, most notably through Lautemann's theorem characterizing the complexity class BPP.
Proved Lautemann's theorem showing BPP is contained in the polynomial hierarchy (Σ₂ ∩ Π₂)
Contributed foundational results in descriptive complexity and finite model theory
Published influential work on logical characterizations of complexity classes
Served as professor at Johannes Gutenberg University Mainz