Список публикаций

Об институте

Научная деятельность

Публикации

Правила оформления научных работ

Администрация

Ученый совет

Диссертационные советы

Отделы

Сотрудники

Аспирантура

Научно-образовательный центр

Адрес института

Адрес: Россия, 119991, Москва, ул. Губкина, д. 8
Тел.: +7(495) 984 81 41
Факс: +7(495) 984 81 39
Сайт: www.mi-ras.ru
E-mail: steklov@mi-ras.ru

Посмотреть карту

Схема проезда

Разборов Александр Александрович
(публикации за последние годы)

по годам

научные публикации

по типам



2018
1.	Alexander Razborov, “On Space and Depth in Resolution”, Computational Complexity, 27:3 (2018), 511-559 (cited: 1)
2.	Albert Atserias, Ilario Bonacina, Susanna de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov, “Clique Is Hard on Average for Regular Resolution”, Proceedings of the 50th ACM Symposium on Theory of Computing (Los Angeles, CA, USA, June 2018), ACM Press, 2018, 866-877

2017
3.	Alexander Razborov, “On the width of semi-algebraic proofs and algorithms”, Mathematics of Operation Research, 42:4 (2017), 1106–1134 (cited: 1) (cited: 1)
4.	Oleg Pikhurko, Alexander Razborov, “Asymptotic structure of graphs with the minimum number of triangles”, Comb. Probab. Comput., 26:1 (2017), 138–160 (cited: 5) (cited: 3) (cited: 5)
5.	L. N. Coregliano, A. A. Razborov, “On the density of transitive tournaments”, J. Graph Theory, 85:1 (2017), 12–21 , arXiv: 1501.04074 (cited: 1) (cited: 2)
6.	Yuan Li, Alexander Razborov, Benjamin Rossman, “On the $AC^0$ Complexity of Subgraph Isomorphism”, SIAM Journal on Computing, 46:3 (2017), 936–971

2016
7.	Alexander Razborov, “A new kind of tradeoffs in propositional proof complexity”, Journal of the ACM, 63:2 (2016), 16 , 14 pp. (cited: 2) (cited: 9)

2015
8.	A. A. Razborov, “Pseudorandom generators hard for $k$-DNF resolution and polynomial calculus resolution”, Ann. of Math. (2), 181:2 (2015), 415–472 (cited: 3) (cited: 5) (cited: 7)

2014
9.	А. А. Разборов, “О $(3,4)$-проблеме Турана с запрещенными подграфами”, Матем. заметки, 95:2 (2014), 271–281 , arXiv: 1210.4605 (цит.: 2) (цит.: 2) ; A. A. Razborov, “On Turán's $(3,4)$-Problem with Forbidden Subgraphs”, Math. Notes, 95:2 (2014), 247–254 (cited: 2) (cited: 1) (cited: 2)
10.	A. A. Razborov, “A product theorem in free groups”, Ann. of Math. (2), 179:2 (2014), 405–429 (cited: 5) (cited: 1) (cited: 1) (cited: 1)

2013
11.	H. Hatami, J. Hladky, D. Král', S. Norin, A. Razborov, “On the number of pentagons in triangle-free graphs”, J. Combin. Theory Ser. A, 120:3 (2013), 722–732 (cited: 20) (cited: 25) (cited: 11) (cited: 32)
12.	A. Razborov, “On the Caccetta-Häggkvist conjecture with forbidden subgraphs”, J. Graph Theory, 74:2 (2013), 236–248 , arXiv: 1107.2247 (cited: 6) (cited: 9) (cited: 3) (cited: 9)
13.	E. Viola, A. Razborov, “Real advantage”, ACM Trans. Comput. Theory, 5:4 (2013), 17 , 8 pp. (cited: 1) (cited: 4)
14.	А. А. Разборов, “What is a Flag Algebra?”, Notices Amer. Math. Soc., 60:10 (2013), 1324–1327
15.	A. Razborov, “Flag algebras: an interim report”, Mathematics of Paul Erdős II, Springer, 2013, 207–232

2012
16.	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. (cited: 10)
17.	H. Hatami, J. Hladký, D. Král, S. Norin, A. Razborov, “Non-three-colourable common graphs exist”, Combin. Probab. Comput., 21:5 (2012), 734–742 (cited: 9) (cited: 9) (cited: 8) (cited: 15)
18.	А. А. Разборов, Коммуникационная сложность, МЦНМО, 2012 с сайта МЦНМО

2011
19.	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 (cited: 2) (cited: 3)
20.	Л. Д. Беклемишев, В. М. Бухштабер, И. Г. Лысëнок, А. А. Мальцев, С. П. Новиков, А. А. Разборов, А. Л. Семëнов, “Сергей Иванович Адян (к восьмидесятилетию со дня рождения)”, УМН, 66:1(397) (2011), 199–200 ; 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
21.	А. А. Разборов, “Об интерпретации Фон-Дер-Флаасса экстремальных примеров для $(3,4)$-проблемы Турана”, Алгоритмические вопросы алгебры и логики, Сборник статей. К 80-летию со дня рождения академика Сергея Ивановича Адяна, Тр. МИАН, 274, МАИК, М., 2011, 269–290 (цит.: 5) (цит.: 7) (цит.: 6) ; Alexander A. Razborov, “On the Fon-Der-Flaass interpretation of extremal examples for Turán's $(3,4)$-problem”, Proc. Steklov Inst. Math., 274 (2011), 247–266 (cited: 6) (cited: 7)
22.	J. Nordströ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 (cited: 2) (cited: 1)
23.	M. Alekhnovich, A. Razborov, “Satisfiability, branch-width and Tseitin tautologies”, Comput. Complexity, 20:4 (2011), 649–678 (cited: 4) (cited: 3) (cited: 3) (cited: 8)
24.	A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, Computational Complexity, 20:4 (2011), 579–590

2010
25.	A. A. Razborov, “On 3-hypergraphs with forbidden 4-vertex configurations”, SIAM J. Discrete Math., 24:3 (2010), 946–963 (cited: 31) (cited: 39) (cited: 31) (cited: 46)
26.	V. Guruswami, J. R. Lee, A. Razborov, “Almost Euclidean subspaces of $\ell^N_1$ via expander codes”, Combinatorica, 30:1 (2010), 47–68 (cited: 1) (cited: 3) (cited: 3) (cited: 4)
27.	S. Artemov, V. Diekert, A. Razborov, “Preface”, Symposium on Computer Science (Moscow, June 7–12, 2008), Theory Comput. Syst., 46, no. 4, 2010, 619
28.	A. A. Razborov, A. A. Sherstov, “The sign-rank of $\mathrm{AC}^0$”, SIAM J. Comput., 39:5 (2010), 1833–1855 (cited: 14) (cited: 24) (cited: 16) (cited: 33)
29.	F. Eisenbrand, N. Hähnle, A. Razborov, T. Rothvoß, “Diameter of polyhedra: limits of abstraction”, Math. Oper. Res., 35:4 (2010), 786–794 (cited: 8) (cited: 16) (cited: 22)

Полный список публикаций