• DocumentCode
    2356437
  • Title

    Efficient oblivious branching programs for threshold functions

  • Author

    Sinha, Rakesh Kumar ; Thathachar, Jayram S.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA
  • fYear
    1994
  • fDate
    20-22 Nov 1994
  • Firstpage
    309
  • Lastpage
    317
  • Abstract
    In his survey paper on branching programs, A.A. Razborov (1991) asked the following question: Does every rectifier-switching network computing the majority of n bits have size n1+Ω(1)? We answer this question in the negative by constructing a simple oblivious branching program of size O(n log3 n/log log n log log log n) for computing any threshold function. This improves the previously best known upper bound of O(n3/2) due to O.B. Lupanov (1965)
  • Keywords
    programming theory; threshold logic; branching programs; oblivious branching programs; rectifier-switching network; threshold function; threshold functions; upper bound; Binary decision diagrams; Boolean functions; Circuits; Computer networks; Computer science; Input variables; Labeling; Length measurement; Size measurement; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
  • Conference_Location
    Santa Fe, NM
  • Print_ISBN
    0-8186-6580-7
  • Type

    conf

  • DOI
    10.1109/SFCS.1994.365684
  • Filename
    365684
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2356437