Valiant's new theory of holographic algorithms is one of the most beautiful ideas in algorithm design in recent memory. It gives a new look on the P versus NP problem. In this theory\, information is represented by a superposition of linear vectors in a holographic mix. This mixture creates the possibility for exponential sized cancellations of fragments of local computations. The underlying computation is done by invoking the Fisher-Kasteleyn-Temperley method for counting perfect matchings for planar graphs (Dimer Problem). Holographic algorithms challenge our conception of what polynomial time computation can do\, in view of the P vs. NP question.

In this talk we will survey the developments in holographic algorithms. No specialized background is assumed. URL:http://www.physics.wisc.edu/twap/view.php?id=2740 END:VEVENT END:VCALENDAR