Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

Submodular maximization is a significant area of interest in combinatorial optimization, with numerous real-world applications. A research team led by Xiaoming SUN from the State Key Lab of Processors ...

It has demonstrated the powerful ability of a quantum computer to perform certain computational tasks more efficiently than a classical computer. Thus, to show quantum advantages is a key problem in ...

Since the very first days of computer science — a field known for its methodical approach to problem-solving — randomness has played an important role. The first program to run on the world’s first ...