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 ...

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 ...

Communication complexity examines the minimum volume of information exchange required among distributed agents to compute a function of their combined inputs. Established nearly four decades ago, this ...

We haven't exactly worked out all of AI's kinks yet. Just try asking ChatGPT to solve a basic math problem or tell you how many R's are in "strawberry." You'll get a different, probably unhinged, ...

Pseudorandom sequences form the backbone of modern cryptography, secure communications and Monte Carlo simulation, requiring deterministic constructions that mimic true randomness under stringent ...