The following pages link to $(2+\varepsilon)$-Sat Is NP-hard (Q5363382):
Displaying 17 items.
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- Linear discrepancy is \(\Pi_2\)-hard to approximate (Q2234789) (← links)
- The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
- (Q4993594) (← links)
- Small Promise CSPs that reduce to large CSPs (Q5043583) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems (Q5138784) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- On the Computational Complexity of Linear Discrepancy (Q5874541) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Max-3-Lin over non-abelian groups with universal factor graphs (Q6053470) (← links)
- Revisiting alphabet reduction in Dinur’s PCP. (Q6062158) (← links)
