• DocumentCode
    1632729
  • Title

    Functions that have read-twice constant width branching programs are not necessarily testable

  • Author

    Fischer, Eldar ; Newman, Ilan

  • Author_Institution
    Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
  • fYear
    2002
  • fDate
    6/24/1905 12:00:00 AM
  • Firstpage
    55
  • Lastpage
    61
  • Abstract
    We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided ε-testing algorithm must make at least Ω(n1/10) many queries for some fixed small enough ε. This shows that Newman´s result (2000) cannot be generalized to read-k-times functions for k > 1
  • Keywords
    Boolean functions; binary decision diagrams; computational complexity; directed graphs; Boolean functions; complexity; directed graph; read-k-times functions; read-twice constant width branching programs; strings; testing algorithm; Adaptive algorithm; Approximation algorithms; Binary decision diagrams; Boolean functions; Computational complexity; Computer science; Hamming distance; National electric code; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
  • Conference_Location
    Montreal, Que.
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-1468-5
  • Type

    conf

  • DOI
    10.1109/CCC.2002.1004342
  • Filename
    1004342
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1632729