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

[Computational Complexity] Another Breakthrough!

Expand Messages
  • Lance
    Speaking of space complexity, Adam Kalai, Adam Klivans and Rocco Servedio have extended Reingold s result to show that every language in randomized logarithmic
    Message 1 of 1 , Apr 1, 2005
    • 0 Attachment
      Speaking of space complexity, Adam Kalai, Adam Klivans and Rocco Servedio have extended Reingold's result to show that every language in randomized logarithmic space has a deterministic log-space simulation, i.e., RL = L. Cool.

      You can find a copy of their paper here.

      --
      Posted by Lance to Computational Complexity at 4/1/2005 05:44:00 AM

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