[Lowerbounds, Upperbounds]

Algorithms are everywhere.

Check this out…. a new 10 page (only!) proof to the PCP theorem due to Irit Dinur:
http://eccc.uni-trier.de/eccc-reports/2005/TR05-046/index.html

Finally I can hope to try to understand the theorem! And supposedly it uses a purely combinatorial amplification lemma.

2 Comments

  1. Yesterday during the ACO seminar Abie said he wanted to give a talk on this! :P

  2. Ryan Williams
    17:47 on April 22nd, 2005

    That makes sense. To me, Dinur’s paper has much of the same style as Reingold’s L = SL (and uses some similar ideas).