• DocumentCode
    2048491
  • Title

    Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size

  • Author

    Hansen, Kristoffer Arnsfelt

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Chicago, Chicago, IL
  • fYear
    2008
  • fDate
    23-26 June 2008
  • Firstpage
    92
  • Lastpage
    99
  • Abstract
    We revisit the computational power of constant width polynomial size planar nondeterministic branching programs. We show that they are capable of computing any function computed by a Pi2 o CC0 o AC0 circuit in polynomial size. In the quasipolynomial size setting we obtain a characterization of ACC0 by constant width planar non-deterministic branching programs.
  • Keywords
    polynomials; computational power; planar nondeterministic branching programs; quasipolynomial size; Binary decision diagrams; Circuit simulation; Computational complexity; Computational modeling; Computer science; Polynomials; Upper bound; Branching Programs; Circuits; Constant Width; Planarity;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2008. CCC '08. 23rd Annual IEEE Conference on
  • Conference_Location
    College Park, MD
  • ISSN
    1093-0159
  • Print_ISBN
    978-0-7695-3169-4
  • Type

    conf

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