Testing Basic Boolean Formulae
Published in SIAM Journal on Discrete Mathematics • Jan 1, 2002
NobleIDNI2P30W44R09S88
Authors:,,
Michal Parnas
Dana Ron
Alex Samorodnitsky
Abstract
We consider the problem of determining whether a given function $f:{\{0,1\}}^n\to{\{0,1\}}$ belongs to a certain class of Boolean functions $\cal F$ or whether it is far from the class. More precisely, given query access to the function f and given a distance parameter $\epsilon$, we would like to d...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!