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

[Computational Complexity] The Day After

Expand Messages
  • Lance
    Many of you submitted papers to the Complexity conference by yesterday s deadline, now you should let the world see them. Submit your papers to an archive
    Message 1 of 1 , Dec 5, 2005
    • 0 Attachment
      Many of you submitted papers to the Complexity conference by yesterday's deadline, now you should let the world see them. Submit your papers to an archive center like CoRR and/or ECCC. It's never too late to submit your STOC submissions as well.

      Talking about the ECCC, Xi Chen and Xiaotie Deng have posted a new paper that apparently shows that 2-player Nash Equilibrium has the same complexity as finding fixed points (PPAD-complete), extending the 4-player result I mentioned in October. A bit surprising, most of us thought that 2-player Nash would be easier to solve.

      --
      Posted by Lance to Computational Complexity at 12/05/2005 09:35:00 AM

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