Reduction from Maximum Inner Product Search to Stable Pair Checking: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary Tag: Reverted |
||
| Line 7: | Line 7: | ||
== Implications == | == Implications == | ||
assume: NSETH<br/>then: for any $\epsilon > {0}$ there is a $c$ such that determining whether a gaiven pair is part of any or all stable matching in the boolean $d$-attribute model with $d = c\log n$ dimensions requires nondeterministic time $\Omega(n^{2-\epsilon})$ | assume: NSETH<br/>then: for any $\epsilon > {0}$ there is a $c$ such that determining whether a gaiven pair is part of any or all stable matching in the boolean $d$-attribute model with $d = c\log n$ dimensions requires co-nondeterministic time $\Omega(n^{2-\epsilon})$ | ||
== Year == | == Year == | ||
Revision as of 12:25, 3 May 2023
FROM: Maximum Inner Product Search TO: Stable Pair Checking
Description
Implications
assume: NSETH
then: for any $\epsilon > {0}$ there is a $c$ such that determining whether a gaiven pair is part of any or all stable matching in the boolean $d$-attribute model with $d = c\log n$ dimensions requires co-nondeterministic time $\Omega(n^{2-\epsilon})$
Year
2016
Reference
Moeller, Daniel, Ramamohan Paturi, and Stefan Schneider. "Subquadratic algorithms for succinct stable matching." International Computer Science Symposium in Russia. Springer, Cham, 2016.