# Chan, Williams (OV Orthogonal Vectors)

Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{({2}-{1}/O(d/log(n)))})$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2016 == Reference == https://epubs.siam.org/doi/abs/10.1137/1.9781611974331.ch87")

## Time Complexity

$O(n^{({2}-{1}/O(d/log(n)))})$

## Space Complexity

words

()

## Description

## Approximate?

Exact

## Randomized?

No, deterministic

## Model of Computation

Word RAM

## Year

2016