Hitting Set Hypothesis (HS Hypothesis): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3011:30, 15 February 2023‎ Admin talk contribs‎ 442 bytes +442‎ Created page with "== Target Problem == HS == 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Hitting_Set_Hypothesis_(HS_Hypothesis)"