A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness

August 24, 2016 Β· Declared Dead Β· πŸ› Electron. Colloquium Comput. Complex.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Deeparnab Chakrabarty, C. Seshadhri arXiv ID 1608.06980 Category cs.DS: Data Structures & Algorithms Cross-listed cs.DM Citations 12 Venue Electron. Colloquium Comput. Complex. Last Checked 4 months ago
Abstract
Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, $O(n \log(n)/\varepsilon)$-query tester for unateness of Boolean functions $f:\{0,1\}^n \to \{0,1\}$. In this note we describe a simple non-adaptive, $O(n \log(n/\varepsilon)/\varepsilon)$ -query tester for unateness for functions over the hypercube with any ordered range.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted