• DocumentCode
    2955686
  • Title

    On Derandomizing Probabilistic Sublinear-Time Algorithms

  • Author

    Zimand, Marius

  • Author_Institution
    Towson Univ., Baltimore
  • fYear
    2007
  • fDate
    13-16 June 2007
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    There exists a positive constant alpha < 1 such that for any function T(n) les n alpha and for any problem L isin BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2-Omega (T(n) log T(n)) fraction of inputs of length n.
  • Keywords
    computational complexity; deterministic algorithms; probability; deterministic algorithm; probabilistic sublinear-time algorithm derandomization; Automata; Circuit simulation; Computational complexity; Computational modeling; Error correction; Error probability; Testing; Tree graphs; Veins;
  • 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.19
  • Filename
    4262746
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2955686