e751118ba85cbba59cc1 · On the shortest linear straight-line program for computing linear forms

{
  "title_en": "On the shortest linear straight-line program for computing linear forms",
  "designation": "",
  "series": "",
  "status": "",
  "date": "2008-08-29",
  "date_original": "August 29, 2008",
  "url": "https://www.nist.gov/publications/shortest-linear-straight-line-program-computing-linear-forms",
  "source": "NIST Publications",
  "display_en": "",
  "authors_en": "Joan Boyar, Philip Matthews, Rene Peralta",
  "abstract_excerpt_en": "We study the complexity of the Shortest Linear Program (SLP) problem, which is to the number of linear operations necessary to compute a set of linear forms. SLP is shown to be NP-hard. Furthermore, a special case of the corresponding decision problem is",
  "id": "e751118ba85cbba59cc1",
  "sources": [
    "NIST Publications"
  ],
  "source_records": [
    {
      "title_en": "On the shortest linear straight-line program for computing linear forms",
      "designation": "",
      "series": "",
      "status": "",
      "date": "2008-08-29",
      "date_original": "August 29, 2008",
      "url": "https://www.nist.gov/publications/shortest-linear-straight-line-program-computing-linear-forms",
      "source": "NIST Publications",
      "display_en": "",
      "authors_en": "Joan Boyar, Philip Matthews, Rene Peralta",
      "abstract_excerpt_en": "We study the complexity of the Shortest Linear Program (SLP) problem, which is to the number of linear operations necessary to compute a set of linear forms. SLP is shown to be NP-hard. Furthermore, a special case of the corresponding decision problem is"
    }
  ],
  "translation_state": "none",
  "possible_title_matches": 1
}