Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Janczak, Maria"'
We study the following variant of the Erd\H{o}s distance problem. Given $E$ and $F$ a point sets in $\mathbb{R}^d$ and $p = (p_1, \ldots, p_q)$ with $p_1+ \cdots + p_q = d$ is an increasing partition of $d$ define $$ B_p(E,F)=\{(|x_1-y_1|, \ldots, |x
Externí odkaz:
http://arxiv.org/abs/1712.04060
In this work, we critique two papers, "A Polynomial-Time Solution to the Clique Problem" by Tamta, Pande, and Dhami, and "A Polynomial-Time Algorithm For Solving Clique Problems" by LaPlante. We summarize and analyze both papers, noting that the algo
Externí odkaz:
http://arxiv.org/abs/1504.06890