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 ...
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 ...
The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. For more than 40 years, Avi Wigderson ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results