• DocumentCode
    3379954
  • Title

    Topology inside NC1

  • Author

    Allender, Eric ; Datta, Samir ; Roy, Sambuddha

  • Author_Institution
    Rutgers Univ., New Brunswick, NJ, USA
  • fYear
    2005
  • fDate
    11-15 June 2005
  • Firstpage
    298
  • Lastpage
    307
  • Abstract
    We show that ACC0 is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC0. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that thickness two already suffices to capture all of NC1.
  • Keywords
    circuit complexity; graph theory; ACC0 characterization; NC1; constant width circuits; planarity; polylogarithmic circuits; polynomial size circuits; topology; Binary decision diagrams; Circuit topology; Complexity theory; Computational complexity; Formal languages; Polynomials; Semiconductor device modeling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-2364-1
  • Type

    conf

  • DOI
    10.1109/CCC.2005.31
  • Filename
    1443094