PhD student’s paper in computational complexity theory accepted at ACM Symposium

Zeyong Li, a PhD student at the NUS Centre for Quantum Technologies, has a paper accepted at the ACM Symposium on Theory of Computing, held earlier this year in Vancouver. 

The single-authored paper “Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform” represents a significant advancement in computational complexity theory. 

By pushing the boundaries of what is understood about circuit complexity, Li’s work showcases ongoing contributions to resolve fundamental questions in computer science. These findings lay crucial groundwork for continuous development of more powerful algorithms and secure cryptographic systems to enhance computational efficiency.