# Hitting Set Hypothesis (HS Hypothesis)

Jump to navigation
Jump to search

## Target Problem

## Description

No randomized algorithm can solve HS on $n$ vectors in $\{0,1\}^d$ in $n^{2-\epsilon}\poly(d)$ time for $\epsilon > 0$.

## Implies the following Hypothesis

## Implied by the following Hypothesis

## Computation Model

Word-RAM on $\log(n)$ bit words

## Proven?

No

## Year

## References/Citation

http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 5