Generate a tailored SOP for Dr. Shuo Pang. Improve your application with a focused, well-structured draft.
Shuo Pang is a lecturer in the Department of Computer Science at the University of Bristol, specializing in computational complexity and discrete mathematics. His research interests focus on proof complexity and the exploration of lower bounds. He examines questions related to graph coloring, particularly if a given graph G with a proper vertex 3-coloring can admit proofs of length less than or equal to |G| raised to the power of 10. Pang’s work involves rigorous proofs that aim to demonstrate the existence of short proofs within restricted formal systems that capture popular algorithms. He is dedicated to uncovering connections between distinct areas of mathematics and theoretical computer science (TCS). Pang has co-authored notable research papers, including explorations into supercritical trade-offs in resolution and cutting planes, as well as lower bounds in non-Gaussian component analysis. His contributions extend to significant publications about graph coloring challenges and the limitations associated with average resolution and proof systems in computational theory.
Department of Physics research themes include Astrophysics, Materials and Devices, Particle Physics, and Quantum and Soft Matter.