• DocumentCode
    2345840
  • Title

    FO[<]-uniformity

  • Author

    Behle, Christoph ; Lange, Klaus-Jörn

  • Author_Institution
    Wilhelm-Schickard-Inst. fur Informatik, Eberhard-Karls-Univ. Tubingen
  • fYear
    0
  • fDate
    0-0 0
  • Lastpage
    189
  • Abstract
    Uniformity notions more restrictive than the usual FO[<, +, *]-uniformity = FO[<, Bit]-uniformity are introduced. It is shown that the general framework exhibited by Barrington et al. still holds if the fan-in of the gates in the corresponding circuits is considered
  • Keywords
    circuit complexity; formal logic; FO[<]-uniformity; complexity classes; uniformity notion; Computational complexity;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2006. CCC 2006. Twenty-First Annual IEEE Conference on
  • Conference_Location
    Prague
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-2596-2
  • Type

    conf

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