Equal Distance

Given two sets $P$ and $Q$ of $n$ and $m = O(n)$ real numbers, respectively, is there a pair $p_1, p_2 \in P$ and a pair $q_1, q_2 \in Q$ such that $p_1-p_2 = q_1-q_2$

Parameters

$n$ : number of real numbers in $P$
$m$ : number of real numbers in $Q$ ; $m = O(n)$

Related Problems

Equal Distance

Segments Containing Points

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table