1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CC2019
Testing convexity of functions over finite domains
Aleksandrs Belovs, Eric Blais, Abhinav Bommireddi
We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the no…
cs.DS2016★ 1 cited
Testing submodularity and other properties of valuation functions
Eric Blais, Abhinav Bommireddi
We show that for any constant and , it is possible to distinguish functions that are submodular from those that are -far from every sub…