Parametrized Inapproximability Hypothesis (PIH): 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 10:3110:31, 15 February 2023‎ Admin talk contribs‎ 452 bytes +452‎ Created page with "== Target Problem == Approximate 2-CSP == Description == There is some constant $\delta > 0$ such that 2-CSP on $k$ vertices and alphabet size $n$ is W(1)-hard to approximate to a $(1-\delta)$ factor == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == == Proven? == No == Year == 2017 == References/Citation == https://epubs.siam.org/doi/abs/10.1137/1.9781611975994.134"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Parametrized_Inapproximability_Hypothesis_(PIH)"