Alexander Razborov
Alexander Razborov | |
|---|---|
| Nascimento | 16 de fevereiro de 1963 (55 anos) |
| Nacionalidade |  Russo |
Alma mater | Universidade Estatal de Moscovo |
| Prêmios | Prêmio Nevanlinna (1990), Tarski Lectures (2000), Prêmio Gödel (2007) |
| Orientador(es) | Sergei Adian |
| Instituições | Instituto de Matemática Steklov, Universidade de Chicago |
| Campo(s) | Matemática |
| Tese | 1987: On Systems of Equations in a Free Group |
Aleksandr Aleksandrovich Razborov (em russo: Алекса́ндр Александро́вич Разбо́ров; 16 de fevereiro de 1963), mais conhecido como Sasha Razborov, é um matemático e teórico computacional russo.
Publicações |
Razborov, A. A. (1985). «Lower bounds for the monotone complexity of some Boolean functions» (PDF). Soviet Mathematics Doklady. 31: 354–357
Razborov, A. A. (1985). «Lower bounds on monotone complexity of the logical permanent». Mathematical Notes of the Academy of Sciences of the USSR (PDF)<|formato=requer|url=(ajuda). 37 (6): 485–493. doi:10.1007/BF01157687
Разборов, Александр Александрович (1987). О системах уравнений в свободной группе (PDF) (em Russian). [S.l.]: Московский государственный университет !CS1 manut: Língua não reconhecida (link) (PhD thesis. 32.56MB)
Razborov, A. A. (1987). «Lower bounds on the size of bounded depth circuits over a complete basis with logical addition». Mathematical Notes of the Academy of Sciences of the USSR (PDF)<|formato=requer|url=(ajuda). 41 (4): 333–338. doi:10.1007/BF01137685
Razborov, Alexander A. (1989). «On the method of approximations» (PDF. 1.41MB). Proceedings of the 21st Annual ACM Symposium on the Theory of Computing. Seattle, Washington, United States. pp. 167–176. doi:10.1145/73007.73023
Razborov, A. A. (1990). «Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits». Mathematical Notes of the Academy of Sciences of the USSR (PDF)<|formato=requer|url=(ajuda). 48 (6): 1226–1234. doi:10.1007/BF01240265
Razborov, Alexander A.; Rudich, Stephen (1994). «Natural proofs» (PostScript). Proceedings of the 26th Annual ACM Symposium on the Theory of Computing. Montreal, Quebec, Canada. pp. 204–213. doi:10.1145/195058.195134 A referência emprega parâmetros obsoletos|coautor=(ajuda)
Razborov, Alexander A. (1998). «Lower Bounds for the Polynomial Calculus» (PostScript). Computational Complexity. 7 (4): 291–324. doi:10.1007/s000370050013
Razborov, Alexander A. (2003). «Propositional proof complexity» (PostScript). Journal of the ACM. 50 (1): 80–82. doi:10.1145/602382.602406 (Survey paper for JACM's 50th anniversary)
Ligações externas |
Alexander Razborov (em inglês) no Mathematics Genealogy Project.
Alexander Razborov's Home Page.
All-Russian Mathematical Portal: Persons: Razborov Alexander Alexandrovich.
Biography sketch in the Toyota Technological Institute at Chicago.
Curricula Vitae at the Department of Computer Science, University of Chicago.
DBLP: Alexander A. Razborov.- MathSciNet: "Items authored by Razborov, A. A."
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.
