Alexander Razborov
From Wikipedia, the free encyclopedia
Alexander Razborov is a Russian mathematician and computational theorist who won the Nevanlinna Prize in 1990 for his work in theoretical aspects of computer science. His advisor was Sergei Adian. In his best known work, joint with Steven Rudich, he introduced the notion of natural proofs, a class of strategies used to prove fundamental lower bounds in computational complexity. In particular, he has shown that such proofs cannot give a resolution of the P=NP problem, so new techniques will be required in order to solve this question.
[edit] External links
- Razborov's web page
- The Work of A.A. Razborov – an article by László Lovász in the Proceedings of the International Congress of Mathematicians, Kyoto, Japan, 1990.
 |
This Russian biographical article is a stub. You can help Wikipedia by expanding it. |
