On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner
| dc.creator | Goldwasser, Shafi | |
| dc.date | 2002-12-01 | |
| dc.date.accessioned | 2026-07-07T03:19:19Z | |
| dc.date.available | 2026-07-07T03:19:19Z | |
| dc.description | Madhu Sudan's work spans many areas of computer science theory including computational complexity theory, the design of efficient algorithms, algorithmic coding theory, and the theory of program checking and correcting. Two results of Sudan stand out in the impact they have had on the mathematics of computation. The first work shows a probabilistic characterization of the class NP -- those sets for which short and easily checkable proofs of membership exist, and demonstrates consequences of this characterization to classifying the complexity of approximation problems. The second work shows a polynomial time algorithm for list decoding the Reed Solomon error correcting codes. This short note will be devoted to describing Sudan's work on probabilistically checkable proofs -- the so called {\it PCP theorem} and its implications. | |
| dc.identifier | https://arxiv.org/abs/cs/0212056 | |
| dc.identifier | http://arxiv.org/abs/cs/0212056 | |
| dc.identifier | Proceedings of the ICM, Beijing 2002, vol. 1, 105--115 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31414 | |
| dc.subject | Computational Complexity | |
| dc.title | On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner | |
| dc.type | text |