Parametrized Inapproximability Hypothesis (PIH)
Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (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")
Target Problem
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