Speciality: 01.01.06 (Mathematical logic, algebra, and number theory)
Phone: +7 (495) 984 81 41 * 37 46
Fax: +7 (499) 135 05 55
E-mail: , ,
Website: https://people.cs.uchicago.edu/~razborov
Keywords: complexity, extremal combinatorics.
UDC: 510.52, 510.662, 519.712.4, 512.54, 512.554.322, 510.6, 519.85, 519.176, 519.179.1
MSC: 03F20, 03D15, 68Q17, 68Q15

Subject:

Theoretical Computer Science, Discrete Mathematics.

Main publications:

1. A. A. Razborov, “Flag algebras”, J. Symbolic Logic, 72:4 (2007), 1239–1282            
2. A. A. Razborov, “Quantum communication complexity of symmetric predicates”, Izv. Math., 67:1 (2003), 145–159                
3. A. A. Razborov, S. Rudich, “Natural proofs”, J. Comput. System Sci., 55:1 (1997), 24–35          
4. A. A. Razborov, “Lower bounds on monotone complexity of the logical permanent”, Math. Notes, 37:6 (1985), 485–493              
5. A. A. Razborov, “On systems of equations in a free group”, Math. USSR-Izv., 25:1 (1985), 115–162            

Recent publications

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• 
• 

Organisations:

• Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
• Steklov International Mathematical Center
• Toyota Technological Institute at Chicago
• University of Chicago
• Moscow Mathematical Society