Loading ...
Sorry, an error occurred while loading the content.

[My Computational Complexity Web Log] A Zero-One Law for RP

Expand Messages
  • Lance Fortnow
    Russell Impagliazzo and Phillipe Moser have an upcoming Complexity paper entitled A Zero-One Law for RP . What does that mean? Jack Lutz defined a notion of
    Message 1 of 1 , Feb 25, 2003
    • 0 Attachment
      Russell Impagliazzo and Phillipe Moser have an upcoming Complexity paper entitled A Zero-One Law for RP. What does that mean?

      Jack Lutz defined a notion of resource-bounded measure to find the relative size of complexity classes within exponential time. He has many surveys and research papers available on this interesting topic. Whether NP has measure zero in EXP is the most exciting open question in this area.

      Dieter van Melkebeek noted that the Impagliazzo-Wigderson derandomization results implied a zero-one law for BPP: Either BPP=EXP and has measure one or there is sufficient derandomization to show BPP has measure zero.

      The ideas do not directly work for the one-sided error class RP. The new Impagliazzo-Moser paper shows how to overcome these difficulties to get the zero-one law for RP. They also show that if RP does not have measure zero then not only RP but ZPP is equal to EXP. They also show some new derandomization if NP does not have measure zero, i.e., to get that AM = NP.

      --
      Posted by Lance Fortnow to My Computational Complexity Web Log at 2/25/2003 3:50:31 PM

      Powered by Blogger Pro

    Your message has been successfully submitted and would be delivered to recipients shortly.