• Title of article

    On the hardness of approximating Max-Satisfy

  • Author/Authors

    Uriel Feige، نويسنده , , Daniel Reichman، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 2006
  • Pages
    5
  • From page
    31
  • To page
    35
  • Keywords
    computational complexity , approximation algorithms
  • Journal title
    Information Processing Letters
  • Serial Year
    2006
  • Journal title
    Information Processing Letters
  • Record number

    130179

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130179