# Weak Parametrized Inapproximability Hypothesis (WPIH)

Jump to navigation
Jump to search

## Target Problem

## Description

There is some constant $\delta > 0$ such that given an instance $\varphi$ of 2-CSP on the Boolean hypercube graph $Q$ over alphabet of size $n$, it is W(1)-hard to distinguish

## Implies the following Hypothesis

## Implied by the following Hypothesis

## Computation Model

## Proven?

No

## Year

## References/Citation

? CCC '22