• DocumentCode
    2955922
  • Title

    On Approximate Majority and Probabilistic Time

  • Author

    Viola, Emanuele

  • Author_Institution
    Inst. for Adv. Study Princeton, Princeton
  • fYear
    2007
  • fDate
    13-16 June 2007
  • Firstpage
    155
  • Lastpage
    168
  • Abstract
    We prove new results on the circuit complexity of approximate majority, which is the problem of computing majority of a given bit string whose fraction of 1´s is bounded away from 1/2 (by a constant). We then apply these results to obtain new relationships between probabilistic time, BPTime (t), and alternating time, SigmaO(1)Time (t).
  • Keywords
    approximation theory; probability; alternating time; approximate majority; bit string; probabilistic time; Circuits; Complexity theory; Computational complexity; Computational modeling; Computer science; Logic; Mathematics; Polynomials; Turing machines; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on
  • Conference_Location
    San Diego, CA
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-2780-9
  • Type

    conf

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