Search arXiv⌕ Search

arXiv · 0708.2105

Attribute Estimation and Testing Quasi-Symmetry

Abstract

A Boolean function is symmetric if it is invariant under all permutations of its arguments; it is quasi-symmetric if it is symmetric with respect to the arguments on which it actually depends. We present a test that accepts every quasi-symmetric function and, except with an error probability at most delta>0, rejects every function that differs from every quasi-symmetric function on at least a fraction epsilon>0 of the inputs. For a function of n arguments, the test probes the function at O((n/epsilon)\log(n/delta)) inputs. Our quasi-symmetry test acquires information concerning the arguments on which the function actually depends. To do this, it employs a generalization of the property testing paradigm that we call attribute estimation. Like property testing, attribute estimation uses random sampling to obtain results that have only "one-sided'' errors and that are close to accurate with high probability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krzysztof Majewski, Nicholas Pippenger. 2007-08-15. Attribute Estimation and Testing Quasi-Symmetry. https://arxiv.org/abs/0708.2105

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Resolution of The Linear-Bounded Automata Question

This paper resolves a famous and longstanding open question in automata theory, i.e., the {\it linear-bounded automata question} (or, for short, the LBA question), which can also be phrased succinctly in the language of computational complexity theory as $${\rm NSPACE}[n]\overset{?}{=}{\rm DSPACE}[n]. $$ In fact, we prove a more general result that $${\rm DSPACE}[S(n)]\subsetneqq {\rm NSPACE}[S(n)], $$where $S(n)\geq n$ is a space-constructible function. Our proof technique is based on diagonalization against deterministic $S(n)$ space-bounded Turing machines by means of a universal nondeterministic Turing machine, together with other novel and interesting new techniques developed in this paper. Our proof also implies the following consequences, which resolve some famous open questions in complexity theory: (1). ${\rm DSPACE}[n]\subsetneqq {\rm NSPACE}[n]$; (2). $L\subsetneqq NL$; (3). $L\subsetneqq P$; (4). There exists no deterministic Turing machine working in $O(\log n)$ space that decides the $st$-connectivity question (STCON).

cs.CC↗

The Quantumly Fast and the Classically Forrious

We study the extremal Forrelation problem, where, provided with oracle access to Boolean functions $f$ and $g$ promised to satisfy either $\operatorname{forr}(f,g)=1$ or $\operatorname{forr}(f,g)=-1$, one must determine (with high probability) which of the two cases holds while performing as few oracle queries as possible. It is well known that this problem can be solved with one quantum query; yet, Girish and Servedio (ITCS 2026) recently showed this problem requires $\widetildeΩ(2^{n/4})$ classical queries, and conjectured the optimal bound to be $\widetildeΘ(2^{n/2})$. By generalizing their construction, we build on their result and prove a non-adaptive lower bound of $Ω(2^{(1/2- o(1))n})$, which matches the conjectured lower bound up to a vanishing constant in the exponent.

cs.CC↗

Additional properties of parity based bit-counting complexity classes and hierarchies

We study some properties of the parity based bit-counting complexity classes ${\bf B_{|0| \oplus}P}$ and ${\bf B_{|1| \oplus}P}$. We first prove that both of these complexity classes are closed under complement and ${\bf B_{|1|\oplus}P}\subseteq {\bf B_{|0|\oplus}P}$. We then prove that ${\bf US}\subseteq {\bf P}^{{\bf B_{|1|\oplus}P}}$ and ${\bf US}\subseteq {\bf P}^{{\bf B_{|0|\oplus}P}}$. We then study the class defining characteristic functions of the parity based bit-counting complexity classes, where the one associated with ${\bf B_{|1| \oplus}P}$ produces the Prouhet-Thue-Morse sequence. We then prove that a contiguous block of four values from either sequence determines the parity of its starting index and use this fact to show that ${\bf \oplus P}\subseteq {\bf P}^{{\bf B_{|0|\oplus}P}}$ and ${\bf \oplus P}\subseteq {\bf P}^{{\bf B_{|1|\oplus}P}}$. We then use the parity based bit-counting complexity classes to define various hierarchies and show that they all contain ${\bf PH}$ and are contained in ${\bf CH}$.

cs.CC↗