Friedrich Slivovsky

Dr. Friedrich Slivovsky is a computer scientist specializing in computational complexity, logic in computer science, and algorithm design. His research focuses on quantified Boolean formulas (QBF), SAT solving, and circuit minimization, with recent contributions to fine-grained complexity analysis and structure-aware lower bounds. He serves as a module co-ordinator for postgraduate and undergraduate courses in optimization at his institution.

• 2025: Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas (QBF complexity, dependency schemes)
• 2024: Strategy Extraction by Interpolation (proof complexity), eSLIM: Circuit Minimization with SAT (logic synthesis), Hardness of Random Parity Encodings (CDCL solver analysis)
• 2023: Circuit Minimization with QBF-Based Synthesis (exact circuit optimization), Structure-Aware QBF Lower Bounds (tractability expansion)

His work bridges theoretical analysis with practical applications in automated reasoning and formal verification. Teaching roles include coordinating optimization modules, emphasizing algorithmic efficiency and computational problem-solving.