{
  "version": "1.0",
  "type": "rich",
  "title": "Approximating E3-LIN is NP-Hard",
  "author_name": "Evan Chen 《陳誼廷》",
  "author_url": "https://blog.evanchen.cc/",
  "provider_name": "Power Overwhelming",
  "provider_url": "https://blog.evanchen.cc/",
  "url": "https://blog.evanchen.cc/e3lin/",
  "description": "This lecture, which I gave for my 18.434 seminar, focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. 1. Introducing MAX-E3LIN In the…",
  "html": "<blockquote><b><a href=\"https://blog.evanchen.cc/e3lin/\">Approximating E3-LIN is NP-Hard</a></b><p>This lecture, which I gave for my 18.434 seminar, focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. 1. Introducing MAX-E3LIN In the…</p><footer>Evan Chen 《陳誼廷》 — <a href=\"https://blog.evanchen.cc/\">Power Overwhelming</a></footer></blockquote>",
  "width": 800,
  "height": null
}