Gap MCSP #
Gap MCSP is a genuine promise problem over the existing canonical MCSP codec.
The source threshold is part of each instance; an explicit parameter map gives
the relaxed no-threshold. The public theory exposes the monotonicity directions
needed for quantitative hardness-magnification reductions. Arity-indexed
sliceProblem specializes this to the conventional GapMCSP[s_yes, s_no]
form and provides exact table-preserving threshold re-encoding reductions.
The gap yes predicate is exactly ordinary MCSP membership for a decoded instance.
Increasing the source threshold preserves the gap yes predicate.
Under a monotone relaxation map, increasing the source threshold can only shrink the no side.
Raising the relaxed threshold shrinks the no predicate.
The encoded gap yes language is definitionally the existing total MCSP language; only the no side introduces a promise.
Pointwise raising the relaxed threshold shrinks the encoded no language.
Widening makes the canonical yes and no languages disjoint.
Canonical Gap MCSP promise problem under a widening threshold map.
Equations
- Complexity.GapMCSP.problem parameters hwidening = { yesInstances := Complexity.GapMCSP.yesLanguage, noInstances := Complexity.GapMCSP.noLanguage parameters, disjoint := ⋯ }
Instances For
If the target uses a pointwise smaller relaxed threshold, identity is a side-preserving reduction: the yes side is unchanged and the target no side is larger.