Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Alexander A. Razborov"'
Publikováno v:
Математический сборник. 213:119-140
Одна из гипотез Эрдeша утверждает, что в каждом графе без треугольников на $n$ вершинах есть индуцированный подграф на $n/2$ вершинах с не бо
Autor:
Alexander A. Razborov, V. S. Atabekyan, Lev D. Beklemishev, Aleksei L'vovich Semenov, V. S. Guba, Igor Geront'evich Lysenok
Publikováno v:
Russian Mathematical Surveys. 76:1-27
This is a survey of results on the Burnside problem and properties of Burnside groups, the finite basis problem for group identities, periodic products of groups and Malcev’s problem, construction of groups with special properties (Tarski monsters)
Autor:
Victor Antonovich Sadovnichii, Alexander A. Razborov, Lev D. Beklemishev, Igor Geront'evich Lysenok, V. S. Guba, Sergey Novikov, Alexey Talambutsa, L. N. Shevrin, Victor Matveevich Buchstaber, Yu. S. Osipov, Yu. L. Ershov, V. S. Atabekyan, Valerii Vasil'evich Kozlov, Aleksei L'vovich Semenov, Sergey Goncharov, Dmitry Treschev, Mati Pentus, Vladimir V. Podolskii
Publikováno v:
Russian Mathematical Surveys. 76:177-181
Autor:
Varuzhan Sergeevich Atabekyan, Yurii S Osipov, Igor Geront'evich Lysenok, Alexey Talambutsa, Lev D. Beklemishev, Sergey Goncharov, Dmitrii Valer'evich Treschev, Lev Naumovich Shevrin, Алексей Львович Семeнов, Mati Pentus, Victor Antonovich Sadovnichii, Victor Matveevich Buchstaber, Valery V. Kozlov, Sergei Petrovich Novikov, Alexander A. Razborov, Yurii Leonidovich Ershov, Игорь Геронтьевич Лысeнок, Vladimir V. Podolskii, Aleksei L'vovich Semenov, Victor Guba
Publikováno v:
Uspekhi Matematicheskikh Nauk. 76:191-194
Autor:
Varuzhan Sergeevich Atabekyan, Lev Dmitrievich Beklemishev, Victor Sergeevich Guba, Игорь Геронтьевич Лысeнок, Igor Geront'evich Lysenok, Alexander Alexandrovich Razborov, Алексей Львович Семeнов, Aleksei Lvovich Semenov
Publikováno v:
Uspekhi Matematicheskikh Nauk. 76:3-30
Дан обзор результатов по проблеме Бернсайда и свойствам бернсайдовых групп, проблеме конечного базиса групповых тождеств, периодическ
Autor:
Alexander A. Razborov, Dhruv Mubayi
Publikováno v:
Proceedings of the London Mathematical Society. 122:69-92
Given $s \ge k\ge 3$, let $h^{(k)}(s)$ be the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs $H$ whose independence number is at most polylogarithmic in the number of vertices and in which every $s$ vertices span at most
Publikováno v:
Uspekhi Matematicheskikh Nauk. 75:45-152
Теория пределов дискретных комбинаторных объектов успешно развивается в течение последнего десятилетия. Синтаксический, алгебраическ
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have been done in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95213638de273f134e0a50bb8e8a0ce8
http://arxiv.org/abs/2012.11773
http://arxiv.org/abs/2012.11773
Autor:
Susanna F. de Rezende, Ilario Bonacina, Jakob Nordström, Massimo Lauria, Albert Atserias, Alexander A. Razborov
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Scopus-Elsevier
Recercat. Dipósit de la Recerca de Catalunya
instname
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
STOC
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing-STOC 2018
Universitat Politècnica de Catalunya (UPC)
Scopus-Elsevier
Recercat. Dipósit de la Recerca de Catalunya
instname
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
STOC
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing-STOC 2018
We prove that for k ≪ 4√n regular resolution requires length nΩ(k) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4358b5424aed31f07e64de86ce6bc749
http://arxiv.org/abs/2012.09476
http://arxiv.org/abs/2012.09476
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2020 ISBN: 9783030518240
SAT
SAT
We prove that CDCL SAT-solvers with the ordered decision strategy and the DECISION learning scheme are equivalent to ordered resolution. We also prove that, by replacing this learning scheme with its opposite, which learns the first possible non-conf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b397bb0d51fc8f83566bc94debfcec1a
https://doi.org/10.1007/978-3-030-51825-7_12
https://doi.org/10.1007/978-3-030-51825-7_12