Jan Pich

Jan Pich is a Royal Society Research Fellow in the Department of Computer Science at the University of Oxford, specializing in theoretical computer science with a focus on the intersection of mathematical logic and computational complexity. He is affiliated with the department's Algorithms and Complexity Theory research theme.

His research centers on proof complexity, which investigates the resources required for formal mathematical proofs, and circuit complexity, analyzing the efficiency of Boolean circuits. Dr. Pich currently leads a project titled "Proof complexity and circuit complexity: a unified approach" that develops theoretical frameworks to bridge these subfields. This work addresses fundamental questions about computational limits and logical reasoning systems, contributing to foundational knowledge in theoretical computer science.

He has received the prestigious Royal Society Research Fellowship, a competitive award supporting independent scientific research.

No information is available regarding his academic advising activities or additional research grants beyond his fellowship. Similarly, no specific laboratories, research teams, or collaborative groups are mentioned in the provided context.