{
  "abstract": "We introduce the iterated factor method as an extension of the factor method due to Alfred Brauer. This new method has been used to obtain an improved upper bound for an optimal length of an addition chain leading to 2^n -1 in special cases that depends on the binary structure of the exponent n.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 1,
  "authors": [
    {
      "name": "Theophilus Agama"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/cbqkdcgtcm83j.bib",
  "cited_by": 0,
  "doi": null,
  "fulltext_url": null,
  "id": "cbqkdcgtcm83j",
  "issns": [],
  "landing_url": "https://hal.science/hal-05784769v1",
  "language": "en",
  "licence": "CC-BY-ND-4.0",
  "licence_label": "CC BY-ND 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by-nd/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "hal",
      "0.math"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://hal.science/hal-05784769/document",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-07",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/cbqkdcgtcm83j.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:50Z",
      "native_id": "hal-05784769",
      "source": "hal",
      "url": "https://hal.science/hal-05784769v1"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "hal:0.math",
      "subfield": "general"
    }
  ],
  "title": "ON SOME COMPUTATIONAL RESULTS ON ADDITION CHAINS",
  "title_text": "ON SOME COMPUTATIONAL RESULTS ON ADDITION CHAINS",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:50Z",
  "url": "https://research.draconitic.com/paper/cbqkdcgtcm83j",
  "venue": "HAL",
  "versions": []
}