π
π
The Cartographer
An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness
August 08, 2016 Β· Declared Dead Β· π Electron. Colloquium Comput. Complex.
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Subhash Khot, Igor Shinkar
arXiv ID
1608.02451
Category
cs.DS: Data Structures & Algorithms
Citations
21
Venue
Electron. Colloquium Comput. Complex.
Last Checked
3 months ago
Abstract
We present an adaptive tester for the unateness property of Boolean functions. Given a function $f:\{0,1\}^n \to \{0,1\}$ the tester makes $O(n \log(n)/Ξ΅)$ adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is $Ξ΅$-far from being unate.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted