Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Wallheimer, Nathan"'
Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm that takes
Externí odkaz:
http://arxiv.org/abs/2410.18661
Autor:
Abboud, Amir, Wallheimer, Nathan
A recent paper by Abboud and Wallheimer [ITCS 2023] presents self-reductions for various fundamental graph problems, which transform worst-case instances to expanders, thus proving that the complexity remains unchanged if the input is assumed to be a
Externí odkaz:
http://arxiv.org/abs/2403.08394
Autor:
Abboud, Amir, Wallheimer, Nathan
In recent years, the expander decomposition method was used to develop many graph algorithms, resulting in major improvements to longstanding complexity barriers. This powerful hammer has led the community to (1) believe that most problems are as eas
Externí odkaz:
http://arxiv.org/abs/2211.12833
Let $G=(V,E)$ be an undirected unweighted planar graph. Consider a vector storing the distances from an arbitrary vertex $v$ to all vertices $S = \{ s_1 , s_2 , \ldots , s_k \}$ of a single face in their cyclic order. The pattern of $v$ is obtained b
Externí odkaz:
http://arxiv.org/abs/2202.05127