Reduction from Maximum Inner Product Search to Stable Pair Checking: 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.

3 May 2023

15 February 2023

  • curprev 12:1912:19, 15 February 2023‎ Admin talk contribs‎ 623 bytes +623‎ Created page with "FROM: Maximum Inner Product Search TO: Stable Pair Checking == Description == == Implications == assume: OVH<br/>then: for any $\epsilon > {0}$, there is a $c$ such that determining whether a given pair is part of any or all stable matchings in the boolean $d$-attribute model with $d = c\log n$ dimensions requires time $\Omega(n^{2-\epsilon})$ == Year == 2016 == Reference == Moeller, Daniel, Ramamohan Paturi, and Stefan Schneider. "Subquadratic algor..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_Maximum_Inner_Product_Search_to_Stable_Pair_Checking"