2 papers
cs.CC2023
An improved protocol for ExactlyN with more than 3 players
Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif +2
The ExactlyN problem in the number-on-forehead (NOF) communication setting asks players, each of whom can see every input but their own, if the input numbers add up to .…
math.OC2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness
Ankit Garg, Robin Kothari, Praneeth Netrapalli +1
We study the complexity of optimizing highly smooth convex functions. For a positive integer , we want to find an -approximate minimum of a convex function , given oracle…