The following pages link to On the NP-Hardness of Max-Not-2 (Q5419035):
Displaying 6 items.
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- On the robust hardness of Gröbner basis computation (Q1713027) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- (Q6176154) (← links)
