On the NP-Hardness Approximation Curve for Max-2Lin(2)

Documents similaires

• A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
  par: DeJesse, Nicholas, et autres
  Publié: (2025)
• On the Usefulness of Promises
  par: Austrin, Per, et autres
  Publié: (2025)
• SVP$_p$ is Deterministically NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} n}$
  par: Hair, Isaac M., et autres
  Publié: (2025)
• Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
  par: Chavrimootoo, Michael C., et autres
  Publié: (2026)
• Quantum Max-Cut is NP hard to approximate
  par: Piddock, Stephen
  Publié: (2025)