The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We give an adaptive algorithm that tests whether an unknown Boolean function f: {0,1}^n -≈ {0, 1} is unate (i.e. every variable of f is either non-decreasing or non-increasing) or ≥-far from unate with one-sided error and O(n^{3/4}/≥^2) many queries. This improves on the best adaptive O(n/≥)-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova...
We consider the problem of testing whether an unknown Boolean function f : { -- 1, 1}n ⇆ { -- 1, 1} is monotone versus ε-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied problem. Lower bound: We prove an Ω(n1/5) lower bound on the query complexity of any non-adaptive two-sided...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.