
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
Testing of function that have small width branching programs
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
I. Newman, "Testing of function that have small width branching programs," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 251, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892112, author = {I. Newman}, title = {Testing of function that have small width branching programs}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {251}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892112}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Testing of function that have small width branching programs SN  02725428 SP EP A1  I. Newman, PY  2000 KW  randomised algorithms; Boolean functions; probability; computational complexity; directed graphs; small width branching programs; combinatorial property testing; decision problems; Boolean functions; readonce branching programs; randomized algorithm; probability; query complexity; regular languages VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
Combinatorial property testing, initiated formally by (Goldreich et al., 1996) and inspired by (Rubinfeld and Sudan, 1996), deals with the following relaxation of decision problems: given a fixed property and an input x, one wants to decide whether x has the property or is being far from having the property. The main result here is that if G={g:{0,1}/sup n//spl rarr/{0,1}} is a family of Boolean functions that have readonce branching programs of width w, then for every n and /spl epsiv/<0 there is a randomized algorithm that always accepts every x/spl isin/{0,1}/sup n/ if g(x)=1, and rejects it with height probability if at least /spl epsiv/n bits of x should be modified in order for it to be in g/sup 1/(1). The algorithm queries (2w//spl epsiv/)/sup 0(w)/ many queries. In particular, for constant /spl epsiv/ and w, the query complexity is 0(1). This generalizes the results of (Alon et al., 1999) asserting that regular languages are efficiently (/spl epsiv/,O(1))testable.
Index Terms:
randomised algorithms; Boolean functions; probability; computational complexity; directed graphs; small width branching programs; combinatorial property testing; decision problems; Boolean functions; readonce branching programs; randomized algorithm; probability; query complexity; regular languages
Citation:
I. Newman, "Testing of function that have small width branching programs," focs, pp.251, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.