Konstantin Tikhomirov, A remark on the Ramsey number of the hypercube
Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]A well-known conjecture of Burr and Erdős asserts that the Ramsey number
A well-known conjecture of Burr and Erdős asserts that the Ramsey number
We determine the maximum number of copies of
Order types are a combinatorial classification of finite point sets used in discrete and computational geometry. This talk will give an introduction to these objects and their analogue for the …
In computer science, random expressions are commonly used to analyze algorithms, either to study their average complexity, or to generate benchmarks to test them experimentally. In general, these approaches only …
We study the problem of maximizing a continuous DR-submodular function that is not necessarily smooth. We prove that the continuous greedy algorithm achieves an guarantee when the function is monotone …
Let
Following some recent FPT algorithms parameterized by the width of a given tree-partition due to Bodlaender, Cornelissen, and van der Wegen, we consider the parameterized problem of computing a decomposition. …
By a seminal result of Valiant, computing the permanent of (0, 1)-matrices is, in general, #P-hard. In 1913 Pólya asked for which (0, 1)-matrices A it is possible to change …
For fixed integers
A linear