RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Razborov Alexander Alexandrovich

Statistics Math-Net.Ru
Total publications: 97
Scientific articles: 85
Cited articles: 75
Citations in Math-Net.Ru: 154
Citations in Web of Science: 1197
Citations in Scopus: 1471
Citations in MathSciNet: 911
Presentations: 31

Number of views:
This page:4969
Abstract pages:4834
Full texts:1516
References:257
Corresponding member of RAS
Doctor of physico-mathematical sciences (1991)
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: http://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  crossref  mathscinet  zmath  isi  elib  scopus
  2. A. A. Razborov, “Quantum communication complexity of symmetric predicates”, Izv. Math., 67:1 (2003), 145–159  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus
  3. A. A. Razborov, S. Rudich, “Natural proofs”, J. Comput. System Sci., 55:1 (1997), 24–35  crossref  mathscinet  zmath  isi  scopus
  4. A. A. Razborov, “Lower bounds on monotone complexity of the logical permanent”, Math. Notes, 37:6 (1985), 485–493  mathnet  crossref  mathscinet  zmath  isi  elib  scopus
  5. A. A. Razborov, “On systems of equations in a free group”, Izv. AN SSSR. Ser. matem., 48:4 (1984), 779–832  mathnet  mathscinet  zmath  isi; A. A. Razborov, “On systems of equations in a free group”, Math. USSR-Izv., 25:1 (1985), 115–162  crossref  mathscinet  zmath

http://www.mathnet.ru/eng/person8770
List of publications on Google Scholar
http://zbmath.org/authors/?q=ai:razborov.alexander-a
http://www.ams.org/mathscinet/search/author.html?return=viewitems&mrauthid=212097
http://elibrary.ru/author_items.asp?authorid=158

Full list of publications:
1. Alexander Razborov, “A new kind of tradeoffs in propositional proof complexity”, Journal of the ACM, 63:2 (2016), 16 , 14 pp.  mathnet  crossref  isi  scopus
2. A. Razborov, “Pseudorandom generators hard for $k$-DNF resolution and polynomial calculus resolution”, Ann. of Math. (2), 181:2 (2015), 415–472  mathnet (cited: 3)  crossref  mathscinet (cited: 3)  zmath  isi (cited: 2)  elib (cited: 2)  scopus (cited: 2)
3. L. Coregliano, A. Razborov, On the density of transitive tournaments, 2015 , 13 pp., arXiv: 1501.04074
4. A. A. Razborov, “On Turán's $(3,4)$-Problem with Forbidden Subgraphs”, Math. Notes, 95:2 (2014), 247–254  mathnet  crossref  crossref  isi (cited: 1)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
5. A. A. Razborov, “A product theorem in free groups”, Ann. of Math. (2), 179:2 (2014), 405–429  crossref  mathscinet (cited: 1)  zmath  isi (cited: 1)  elib (cited: 1)  scopus (cited: 1)
6. Y. Li, A. Razborov, B. Rossman, “On the $AC^0$ complexity of subgraph isomorphism”, Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (Philadelphia, October 2014), IEEE, 2014
7. H. Hatami, J. Hladky, D. Král', S. Norin, A. Razborov, “On the number of pentagons in triangle-free graphs”, J. Combin. Theory Ser. A, 120:3 (2013), 722–732  crossref  mathscinet (cited: 13)  zmath  isi (cited: 10)  elib (cited: 7)  scopus (cited: 13)
8. A. Razborov, “On the Caccetta-Häggkvist conjecture with forbidden subgraphs”, J. Graph Theory, 74:2 (2013), 236–248 , arXiv: 1107.2247  crossref  mathscinet (cited: 2)  zmath  isi (cited: 3)  elib (cited: 3)  scopus (cited: 3)
9. E. Viola, A. Razborov, “Real advantage”, ACM Trans. Comput. Theory, 5:4 (2013), 17 , 8 pp.  crossref  mathscinet  scopus
10. A. Razborov, “Flag algebras: an interim report”, Mathematics of Paul Erdős II, Springer, 2013, 207–232  crossref
11. O. Pikhurko, A. Razborov, Asymptotic structure of graphs with the minimum number of triangles, 2012 , To appear in “Combinatorics, Probability and Computing”, arXiv: 1204.2846
12. O. Beyersdorff, N. Galesi, M. Lauria, A. A. Razborov, “Parameterized bounded-depth Frege is not optimal”, ACM Transactions on Computation Theory, 4:3 (2012), 7 , 16 pp.  crossref  scopus (cited: 6)
13. H. Hatami, J. Hladký, D. Král, S. Norin, A. Razborov, “Non-three-colourable common graphs exist”, Combin. Probab. Comput., 21:5 (2012), 734–742  crossref  mathscinet (cited: 8)  zmath  isi (cited: 5)  elib (cited: 4)  scopus (cited: 8)
14. O. Beyersdorff, N. Galesi, M. Lauria, A. Razborov, “Parameterized bounded-depth Frege is not optimal”, Automata, languages and programming, Part I, Lecture Notes in Comput. Sci., 6755, Springer, Heidelberg, 2011, 630–641  crossref  mathscinet (cited: 1)  zmath  scopus (cited: 2)
15. Alexander A. Razborov, “On the Fon-Der-Flaass interpretation of extremal examples for Turán's $(3,4)$-problem”, Proc. Steklov Inst. Math., 274 (2011), 247–266  mathnet  crossref  mathscinet  isi (cited: 6)  elib  scopus (cited: 7)
16. J. Nordström, A. Razborov, “On minimal unsatisfiability and time-space trade-offs for $k$-DNF resolution”, Automata, languages and programming. Part I, 38th International Colloquium, ICALP 2011 (Zurich, Switzerland, July 4–8, 2011), Lecture Notes in Computer Science, 6755, eds. Luca Aceto, Monika Henzinger, Jiri Sgall, Springer, Heidelberg, 2011, 642–653  crossref  mathscinet (cited: 2)  zmath  scopus
17. M. Alekhnovich, A. Razborov, “Satisfiability, branch-width and Tseitin tautologies”, Comput. Complexity, 20:4 (2011), 649–678  crossref  mathscinet (cited: 3)  zmath  isi (cited: 1)  elib (cited: 2)  scopus (cited: 3)
18. A. A. Razborov, “On 3-hypergraphs with forbidden 4-vertex configurations”, SIAM J. Discrete Math., 24:3 (2010), 946–963  crossref  mathscinet (cited: 25)  zmath  isi (cited: 28)  elib (cited: 25)  scopus (cited: 33)
19. V. Guruswami, J. R. Lee, A. Razborov, “Almost Euclidean subspaces of $\ell^N_1$ via expander codes”, Combinatorica, 30:1 (2010), 47–68  crossref  mathscinet (cited: 1)  isi (cited: 2)  elib (cited: 3)  scopus (cited: 3)
20. A. A. Razborov, A. A. Sherstov, “The sign-rank of $\mathrm{AC}^0$”, SIAM J. Comput., 39:5 (2010), 1833–1855  crossref  mathscinet (cited: 8)  zmath  isi (cited: 12)  elib (cited: 14)  scopus (cited: 16)
21. F. Eisenbrand, N. Hähnle, A. Razborov, T. Rothvoß, “Diameter of polyhedra: limits of abstraction”, Math. Oper. Res., 35:4 (2010), 786–794  crossref  mathscinet (cited: 8)  zmath  isi (cited: 10)  scopus (cited: 13)
22. A. A. Razborov, “A simple proof of Bazzi's theorem”, ACM Transactions on Computation Theory (TOCT), 1:1 (2009), 3 , 5 pp.  crossref
23. M. Alekhnovich, A. A. Razborov, “Resolution is not automatizable unless $W[P]$ is tractable”, SIAM J. Comput., 38:4 (2008), 1347–1363  crossref  mathscinet (cited: 7)  zmath  isi (cited: 16)  elib (cited: 7)  scopus (cited: 22)
24. A. A. Razborov, “On the minimal density of triangles in graphs”, Combin. Probab. Comput., 17:4 (2008), 603–618  crossref  mathscinet (cited: 38)  zmath  isi (cited: 41)  elib (cited: 40)  scopus (cited: 47)
25. A. A. Razborov, S. Yekhanin, “An $\Omega(n^{1/3})$ lower bound for bilinear group-based private information retrieval”, Theory of Computing, 3 (2007), 221–238  crossref  mathscinet (cited: 6)  zmath
26. A. A. Razborov, “Flag algebras”, J. Symbolic Logic, 72:4 (2007), 1239–1282  crossref  mathscinet (cited: 47)  zmath  isi (cited: 52)  elib (cited: 54)  scopus (cited: 59)
27. V. Lifschitz, A. Razborov, “Why are there so many loop formulas?”, ACM Trans. Comput. Log., 7:2 (2006), 261–268  crossref  mathscinet (cited: 3)  isi (cited: 35)  elib (cited: 53)  scopus (cited: 63)
28. A. A. Razborov, “The ${\mathsf P}\stackrel{?}{=}{\mathsf NP}$-problem: a view from the 1990s”, Mathematical events of the twentieth century, Springer, Berlin, 2006, 331–346  crossref  mathscinet  zmath
29. A. A. Razborov, “Foundations of computational complexity theory”, Surveys in modern mathematics, London Math. Soc. Lecture Note Ser., 321, Cambridge Univ. Press, Cambridge, 2005, 186–202  mathscinet
30. A. A. Razborov, “Guessing more secrets via list decoding”, Internet Math., 2:1 (2005), 21–30  crossref  mathscinet (cited: 1)  zmath
31. M. Alekhnovich, E. Ben-Sasson, A. A. Razborov, A. Wigderson, “Pseudorandom generators in propositional proof complexity”, SIAM J. Comput., 34:1 (2004), 67–88  crossref  mathscinet (cited: 15)  zmath  isi (cited: 22)  scopus (cited: 26)
32. A. A. Razborov, “An upper bound on the threshold quantum decoherence rate”, Quantum Inf. Comput., 4:3 (2004), 222–228  mathscinet  zmath  isi (cited: 9)  elib (cited: 11)  scopus (cited: 11)
33. A. A. Razborov, “Resolution lower bounds for perfect matching principles”, J. Comput. System Sci., 69:1 (2004), 3–27  crossref  mathscinet (cited: 9)  zmath  isi (cited: 10)  elib (cited: 12)  scopus (cited: 14)
34. A. Razborov, “Feasible Proofs and Computations: Partnership and Fusion”, Automata, Languages and Programming, 31st International Colloquium, ICALP 2004 (Turku, Finland, July 12–16, 2004), Lecture Notes in Computer Science, 3142, Springer, 2004, 8–14  crossref  zmath  scopus
35. A. Razborov, “Propositional proof complexity”, J. ACM, 50:1 (2003), 80–82 (electronic)  crossref  mathscinet  isi  scopus
36. A. Razborov, “Resolution lower bounds for the weak functional pigeonhole principle”, Logic and complexity in computer science (Créteil, 2001), Theoret. Comput. Sci., 303, no. 1, 2003, 233–243  crossref  mathscinet (cited: 13)  zmath  isi (cited: 8)  elib (cited: 13)  scopus (cited: 14)
37. A. A. Razborov, “Quantum communication complexity of symmetric predicates”, Izv. Math., 67:1 (2003), 145–159  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 44)  elib (cited: 42)  scopus (cited: 45)
38. M. V. Alekhnovich, A. A. Razborov, “Lower Bounds for Polynomial Calculus: Nonbinomial Case”, Proc. Steklov Inst. Math., 242 (2003), 18–35  mathnet  mathscinet  zmath
39. A. A. Razborov, “Proof complexity of pigeonhole principles”, Developments in language theory (Vienna, 2001), Lecture Notes in Comput. Sci., 2295, Springer, Berlin, 2002, 110–116  mathscinet (cited: 4)  elib
40. A. Razborov, A. Wigderson, A. Yao, “Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus”, Combinatorica, 22:4 (2002), 555–574  crossref  mathscinet (cited: 2)  zmath  isi (cited: 2)  elib (cited: 5)  scopus (cited: 5)
41. M. Alekhnovich, E. Ben-Sasson, A. A. Razborov, A. Wigderson, “Space complexity in propositional calculus”, SIAM J. Comput., 31:4 (2002), 1184–1211 (electronic)  crossref  mathscinet (cited: 18)  zmath  isi (cited: 42)  elib (cited: 50)  scopus (cited: 55)
42. M. V. Alekhnovich, A. A. Razborov, “Lower bounds for polynomial calculus in the case of nonbinomial ideals”, Dokl. Math., 64:2 (2001), 177–179  mathnet  mathscinet  zmath  isi  scopus
43. A. Razborov, Improved Resolution Lower Bounds for the Weak Pigeonhole Principle, Electronic Colloquium on Computational Complexity, 2001
44. D. Grigoriev, A. Razborov, “Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields”, Appl. Algebra Engrg. Comm. Comput., 10:6 (2000), 465–487  crossref  mathscinet (cited: 22)  zmath  isi (cited: 30)  elib (cited: 35)  scopus (cited: 40)
45. A. A. Razborov, Vereshchagin Nikolai K., “A property of cross-intersecting families”, Paul Erdős and his mathematics (Budapest, 1999), János Bolyai Math. Soc., Budapest, 1999, 218–220  mathscinet (cited: 2)  zmath
46. S. Jukna, A. Razborov, P. Savický, I. Wegener, “On $\mathrm{P}$ versus $\mathrm{NP}\cap\mathrm{CO}$-$\mathrm{NP}$ for decision trees and read-once branching programs”, Comput. Complexity, 8:4 (1999), 357–370  crossref  mathscinet (cited: 9)  zmath  isi (cited: 15)  elib (cited: 13)  scopus (cited: 15)
47. A. A. Razborov, “Lower bounds for the polynomial calculus”, Comput. Complexity, 7:4 (1998), 291–324  crossref  mathscinet (cited: 32)  zmath  isi (cited: 48)  elib (cited: 56)  scopus (cited: 60)
48. A. A. Razborov, “O slozhnosti vychislenii”, Trudy matematicheskogo tsentra im. N. I. Lobachevskogo, Izd-vo «UNIPRESS», Kazan, 1998, 8–27  mathscinet
49. S. Jukna, A. Razborov, “Neither reading few bits twice nor reading illegally helps much”, Discrete Appl. Math., 85:3 (1998), 223–238  crossref  mathscinet (cited: 9)  zmath  isi (cited: 13)  elib (cited: 13)  scopus (cited: 15)
50. B. S. Kashin, A. A. Razborov, “Improved lower bounds on the rigidity of Hadamard matrices”, Math. Notes, 63:4 (1998), 471–475  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 14)  elib (cited: 14)  scopus (cited: 17)
51. A. A. Razborov, S. Rudich, “Natural proofs”, J. Comput. System Sci., 55:1 (1997), 24–35  crossref  mathscinet (cited: 73)  zmath  isi (cited: 143)  scopus (cited: 168)
52. A. A. Razborov, “On small size approximation models”, The mathematics of Paul Erdős, I, Algorithms Combin., 13, Springer, Berlin, 1997, 385–392  crossref  mathscinet  zmath
53. A. A. Razborov, “Lower bounds for propositional proofs and independence results in bounded arithmetic”, Automata, languages and programming (Paderborn, 1996), Lecture Notes in Comput. Sci., 1099, Springer, Berlin, 1996, 48–62  crossref  mathscinet (cited: 13)  zmath
54. S. Buss, R. Impagliazzo, J. Krajíček, P. Pudlák, A. A. Razborov, J. Sgall, “Proof complexity in algebraic systems and bounded depth Frege systems with modular counting”, Comput. Complexity, 6:3 (1996), 256–298  crossref  mathscinet (cited: 25)  isi (cited: 13)  elib (cited: 36)  scopus (cited: 38)
55. J. Håstad, A. Razborov, A. Yao, “On the shrinkage exponent for read-once formulae”, Theoret. Comput. Sci., 141:1-2 (1995), 269–282  crossref  mathscinet (cited: 2)  isi (cited: 4)  elib  scopus (cited: 5)
56. A. A. Razborov, “Bounded arithmetic and lower bounds in Boolean complexity”, Feasible mathematics, II (Ithaca, NY, 1992), Progr. Comput. Sci. Appl. Logic, 13, Birkhäuser Boston, Boston, MA, 1995, 344–386  mathscinet (cited: 21)  zmath
57. A. A. Razborov, “On systems of equations in free groups”, Combinatorial and geometric group theory (Edinburgh, 1993), London Math. Soc. Lecture Note Ser., 204, Cambridge Univ. Press, Cambridge, 1995, 269–283  mathscinet (cited: 5)  zmath  isi (cited: 8)
58. A. A. Razborov, “Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic”, Izv. Math., 59:1 (1995), 205–227  mathnet  crossref  mathscinet  zmath  isi (cited: 11)
59. A. Razborov, On Provably Disjoint NP-pairs, BRICS server, BRICS, Aarhus, Denmark, 1994
60. A. Razborov, E. Szemerédi, A. Wigderson, “Constructing small sets that are uniform in arithmetic progressions”, Combin. Probab. Comput., 2:4 (1993), 513–518  crossref  mathscinet (cited: 6)  zmath
61. A. A. Razborov, “On the parameterization of solutions for equations in free groups”, Internat. J. Algebra Comput., 3:3 (1993), 251–273  crossref  mathscinet (cited: 2)  zmath
62. A. A. Razborov, “An equivalence between second order bounded domain bounded arithmetic and first order bounded arithmetic”, Arithmetic, proof theory, and computational complexity (Prague, 1991), Oxford Logic Guides, 23, Oxford Univ. Press, New York, 1993, 247–277  mathscinet (cited: 10)  zmath
63. A. Borodin, A. Razborov, R. Smolensky, “On lower bounds for read-$k$-times branching programs”, Comput. Complexity, 3:1 (1993), 1–18  crossref  mathscinet (cited: 33)  zmath  elib (cited: 29)  scopus (cited: 82)
64. A. Razborov, A. Wigderson, “$n^{\Omega(\log n)}$ lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom”, Inform. Process. Lett., 45:6 (1993), 303–307  crossref  mathscinet (cited: 11)  zmath  isi (cited: 30)  scopus (cited: 37)
65. A. A. Razborov, “On small depth threshold circuits”, Algorithm theory – SWAT '92 (Helsinki, 1992), Lecture Notes in Comput. Sci., 621, Springer, Berlin, 1992, 42–52  crossref  mathscinet (cited: 9)  isi
66. Goldmann Mikael, Håstad Johan, Razborov Alexander, “Majority gates vs. general weighted threshold gates”, Comput. Complexity, 2:4 (1992), 277–300  crossref  mathscinet (cited: 29)  zmath  elib (cited: 21)  scopus (cited: 83)
67. A. A. Razborov, “On submodular complexity measures”, Boolean function complexity (Durham, 1990), London Math. Soc. Lecture Note Ser., 169, Cambridge Univ. Press, Cambridge, 1992, 76–83  mathscinet (cited: 4)
68. A. A. Razborov, “On the distributional complexity of disjointness”, Theoret. Comput. Sci., 106:2 (1992), 385–390  crossref  mathscinet (cited: 41)  zmath  isi (cited: 120)  scopus (cited: 165)
69. A. A. Razborov, “The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear”, Topological, algebraical and combinatorial structures. Frolík's memorial volume, Discrete Math., 108:1-3 (1992), 393–396  crossref  mathscinet (cited: 10)  zmath  isi (cited: 15)  scopus (cited: 18)
70. A. A. Razborov, “Lower bounds for deterministic and nondeterministic branching programs”, Fundamentals of computation theory (Gosen, 1991), Lecture Notes in Comput. Sci., 529, Springer, Berlin, 1991, 47–60  crossref  mathscinet (cited: 21)  isi (cited: 22)
71. M. S. Paterson, A. A. Razborov, “The set of minimal braids is co-NP-complete”, J. Algorithms, 12:3 (1991), 393–408  crossref  mathscinet (cited: 9)  zmath  isi (cited: 20)  elib (cited: 7)  scopus (cited: 29)
72. A. A. Razborov, “Applications of matrix methods to the theory of lower bounds in computational complexity”, Combinatorica, 10:1 (1990), 81–93  crossref  mathscinet (cited: 15)  zmath  isi (cited: 42)  elib (cited: 10)  scopus (cited: 43)
73. A. A. Razborov, “Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits”, Math. Notes, 48:6 (1990), 1226–1234  mathnet  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 4)
74. S. I. Adian, A. A. Razborov, N. N. Repin, “Upper and lower bounds for nilpotency classes of Lie algebras with Engel conditions”, Group theory (Singapore, 1987), de Gruyter, Berlin, 1989, 57–75  mathscinet
75. A. Razborov, “On the Method of Approximation”, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washigton, USA., ACM Press, 1989, 167-176
76. A. A. Razborov, Ob ustoichivykh matritsakh, MIAN, 1989 otskanirovannaya versiya s lichnogo saita
77. A. A. Razborov, “Formuly ogranichennoi glubiny v bazise $\{&,\oplus\}$ i nekotorye kombinatornye zadachi”, Teoriya slozhnosti i prikladnaya matematicheskaya logika, Problemy kibernetiki, 134, 1988, 149–166  mathscinet (cited: 7)  zmath
78. A. A. Razborov, “Lower bounds of the monotone complexity of Boolean functions”, Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986), v. 1, 2, Amer. Math. Soc., Providence, RI, 1987, 1478–1487  mathscinet (cited: 1)
79. A. A. Razborov, “Lower bounds on the size of bounded depth circuits over a complete basis with logical addition”, Math. Notes, 41:4 (1987), 333–338  mathnet  crossref  mathscinet  zmath  isi (cited: 153)  elib (cited: 28)  scopus (cited: 151)
80. S. I. Adian, A. A. Razborov, “Periodic groups and Lie algebras”, Russian Math. Surveys, 42:2 (1987), 1–81  mathnet  crossref  mathscinet  zmath  adsnasa  isi (cited: 2)
81. A. A. Razborov, O sistemakh uravnenii v svobodnykh gruppakh, kand. diss., MIAN, Moskva, 1987 otskanirovannaya versiya s lichnogo saita
82. A. A. Razborov, “Lower estimates of the dimension of schemes of bounded depth in the basis $\{&,\vee,\oplus\}$”, Russian Math. Surveys, 41:4 (1986), 181–182  mathnet  crossref  mathscinet  zmath  adsnasa  isi (cited: 1)
83. A. A. Razborov, “Lower bounds on the monotone complexity of some Boolean functions”, Soviet Math. Doklady, 31 (1985), 354–357  mathnet  mathscinet  zmath  isi (cited: 49)
84. A. A. Razborov, “Lower bounds on monotone complexity of the logical permanent”, Math. Notes, 37:6 (1985), 485–493  mathnet  crossref  mathscinet  zmath  isi (cited: 30)  elib (cited: 4)  scopus (cited: 29)
85. A. A. Razborov, “On systems of equations in a free group”, Izv. AN SSSR. Ser. matem., 48:4 (1984), 779–832  mathnet (cited: 28)  mathscinet (cited: 32)  zmath  isi; A. A. Razborov, “On systems of equations in a free group”, Math. USSR-Izv., 25:1 (1985), 115–162  crossref  mathscinet  zmath
86. A. A. Razborov, “What is a Flag Algebra?”, Notices Amer. Math. Soc., 60:10 (2013), 1324–1327  crossref  mathscinet
87. A. A. Razborov, Kommunikatsionnaya slozhnost, MTsNMO, 2012 s saita MTsNMO
88. L. D. Beklemishev, V. M. Buchstaber, I. G. Lysenok, A. A. Mal'tsev, S. P. Novikov, A. A. Razborov, A. L. Semenov, “Sergei Ivanovich Adian (on his eightieth birthday)”, Russian Math. Surveys, 66:1 (2011), 197–198  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib
89. A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, Computational Complexity, 20:4 (2011), 579–590  crossref  mathscinet  zmath  isi  elib  scopus
90. S. Artemov, V. Diekert, A. Razborov, “Preface”, Symposium on Computer Science (Moscow, June 7–12, 2008), Theory Comput. Syst., 46, no. 4, 2010, 619  crossref  mathscinet  isi  scopus
91. L. D. Beklemishev, I. G. Lysenok, A. A. Mal'tsev, S. P. Novikov, M. R. Pentus, A. A. Razborov, A. L. Semenov, V. A. Uspenskii, “Sergei Ivanovich Adian (on his 75th birthday)”, Russian Math. Surveys, 61:3 (2006), 575–588  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
92. A. A. Razborov, Mat. Pros., 9, MCCME, Moscow, 2005, 12–15  mathnet
93. A. Razborov, “Theoretical Computer Science: vzglyad matematika”, Kompyuterra, 2001, no. 2 elektronnyi variant
94. A. A. Razborov, Mat. Pros., 3, MCCME, Moscow, 1999, 127–141  mathnet
95. M. M. Arslanov, A. A. Razborov, “International School-Conference “Recursion Theory and Theory of Complexity” (WRTCT'97)”, Uspekhi Mat. Nauk, 52:6(318) (1997), 213–214  mathnet  crossref
96. Christos H. Papadimitriou, Oded Goldreich, Avi Wigderson, Alexander A. Razborov, Michael Sipser, “The future of computational complexity theory: part I.”, SIGACT News, 27:3 (1996), 6-12  crossref
97. D. G. Kendall, G. K. Batchelor, N. H. Bingham, W. K. Hayman, J. M. E. Hyland, G. G. Lorentz, H. K. Moffatt, W. Parry, A. A. Razborov, C. A. Robinson, P. Whittle, “Obituary: Andreĭ Nikolaevich Kolmogorov (1903–1987)”, Bull. London Math. Soc., 22:1 (1990), 31–100  crossref  mathscinet (cited: 4)  zmath  isi (cited: 13)

Presentations in Math-Net.Ru
1. Теория сложности док­азательств
Mathematical Logic, Algebra and Computation: A two-day conference dedicated to 85-th anniversary of S. I. Adian
July 18, 2016 15:50   
2. Непрерывная комбинаторика
Knots and Representation Theory
June 16, 2016 17:00
3. Теория сложности доказательств
Colloquium of the Faculty of Computer Science
June 14, 2016 18:10
4. Continuous combinatorics
Colloquium of the Steklov Mathematical Institute of Russian Academy of Sciences
December 25, 2015 16:00   
5. Сложность доказательств. Занятие 3
Summer School "Contemporary Mathematics", 2015
July 28, 2015 11:15   
6. Сложность доказательств. Занятие 2
Summer School "Contemporary Mathematics", 2015
July 27, 2015 09:30   
7. Сложность доказательств. Занятие 1
Summer School "Contemporary Mathematics", 2015
July 26, 2015 15:30   
8. Непрерывная комбинаторика III
Summer mathematical school "Algebra and Geometry", 2014
July 28, 2014 09:30   
9. Непрерывная комбинаторика II
Summer mathematical school "Algebra and Geometry", 2014
July 27, 2014 11:30   
10. Непрерывная комбинаторика I
Summer mathematical school "Algebra and Geometry", 2014
July 26, 2014 16:30   
11. Continuous combinatorics
Globus Seminar
December 26, 2013 15:40   
12. Непрерывная комбинаторика
MIPT Interdepartmental Seminar on Discrete Mathematics
December 18, 2013 18:30
13. Непрерывная комбинаторика. Лекция 3
Summer School "Contemporary Mathematics", 2013
July 25, 2013 12:45   
14. Непрерывная комбинаторика. Лекция 2
Summer School "Contemporary Mathematics", 2013
July 24, 2013 15:30   
15. Непрерывная комбинаторика. Лекция 1
Summer School "Contemporary Mathematics", 2013
July 23, 2013 15:30   
16. On approximation of Boolean functions by small degree real polynomials
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
December 11, 2012 18:30
17. Extremal combinatorics. Lecture 2
Summer School "Contemporary Mathematics", 2012
July 26, 2012 11:15   
18. Extremal combinatorics. Lecture 1
Summer School "Contemporary Mathematics", 2012
July 25, 2012 09:30   
19. Алгебры флагов
Meetings of the St. Petersburg Mathematical Society
December 27, 2011 18:00
20. Computational complexity theory. Lecture 3
Summer School "Contemporary Mathematics", 2011
July 25, 2011 12:45   
21. Computational complexity theory. Lecture 2
Summer School "Contemporary Mathematics", 2011
July 24, 2011 12:45   
22. Computational complexity theory. Lecture 1
Summer School "Contemporary Mathematics", 2011
July 23, 2011 09:30   
23. Algebraic complexity. II
Summer School "Contemporary Mathematics", 2010
July 24, 2010 09:30   
24. Algebraic complexity. I
Summer School "Contemporary Mathematics", 2010
July 23, 2010 15:30   
25. Flag algebras
Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science"
December 17, 2009 10:30   
26. Коммуникационная сложность. Лекция 2
Summer School "Contemporary Mathematics", 2009
July 27, 2009 09:30   
27. Коммуникационная сложность. Лекция 1
Summer School "Contemporary Mathematics", 2009
July 26, 2009 15:30   
28. Плотность числа треугольников в графах с известной плотностью рёбер
Seminar of the Department of Discrete Mathematics, Steklov Mathematical Institute of RAS
September 2, 2008 16:00
29. Inverse problems of arithmetic combinatorics. Part 2
Summer School "Contemporary Mathematics", 2007
July 29, 2007 09:30   
30. Inverse problems of arithmetic combinatorics. Part 1
Summer School "Contemporary Mathematics", 2007
July 28, 2007 15:45   
31. Proof Complexity of pigeonhole principles
International Workshop on Logic and Complexity in Computer Science (LCCS'2001)
September 5, 2001 09:00   

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2016