Computer Science – Computational Complexity
Scientific paper
2007-08-15
Computer Science
Computational Complexity
Scientific paper
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.
Majewski Krzysztof
Pippenger Nicholas
No associations
LandOfFree
Attribute Estimation and Testing Quasi-Symmetry does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Attribute Estimation and Testing Quasi-Symmetry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Attribute Estimation and Testing Quasi-Symmetry will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-331288