Construct · 1 fields · 1 citations

orthogonal vectors conjecture: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
orthogonalvectors conjecture1 CONSTRUCTOrthogonal vectorsWILLIAMS · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the hypothesis that deciding whether two sets of Boolean vectors contain an orthogonal pair needs nearly quadratic time, implied by the strong exponential time hypothesis.

In computational complexity, orthogonal vectors conjecture refers to the hypothesis that deciding whether two sets of Boolean vectors contain an orthogonal pair needs nearly quadratic time, implied by the strong exponential time hypothesis. This meaning comes from Williams (2005) in Theoretical Computer Science.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how orthogonal vectors conjecture sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructsexponential time hypothesis1 fields · 1 citationsanchor · a standalone constructhypothesis2 fields · 2 citationsjingle · one word, two constructs

References

  1. Williams, R. (2005). A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science, 348(2-3), 357-365. https://doi.org/10.1016/j.tcs.2005.09.023

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct