Roksana Baleshzar

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We give a unateness tester for functions of the form f : [n] d → R, where n, d ∈ N and R ⊆ R with query complexity O(d log(max(d,n))). Previously known unateness testers work only for Boolean functions over the domain {0, 1} d. We show that every unateness tester for real-valued functions over hypergrid has query complexity Ω(min{d, |R| 2 }). Consequently,(More)
  • 1