3-OV

Given 3 sets of $d$ -dimensional vectors $A_1, A_2, A_3$ , each of size $n$ , does there exist $a_1 \in A_1, a_2 \in A_2, a_3 \in A_3$ such that $a_1 * a_2 * a_3 = 0$

Parameters

$n$ : number of vectors per set
$d$ : dimension of each vector; $d = omega(log(n))$

Related Problems

k-OV1
- 3-OV

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table