Talk:Addition-chain exponentiation

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Mathematics Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Example

Someone should add an example. -- 151.198.133.102

There may be an example (if it's the same thing) at Talk:Exponentiation by squaring. -- Toby Bartels 19:59, 7 Aug 2004 (UTC)

NP-hardness of addition chains

The paper "Computing sequences with addition chains" by P. Downey, B. Leong and R. Sethi, SIAM JOC, v.10, n.3, 1981 proves that finding a shortest addition sequence (i.e. an addition chain containing a given set of integers) is NP-hard. The paper clearly states that it is an open problem whether finding a shortest addition chain for an integer is NP-complete. Despite this clear statement the paper is often misrepresented. Is there a new result showing the NP-completeness of finding addition chains or is this article misquoting the paper above too? 85.2.29.86 21:24, 9 August 2007 (UTC)[reply]

You're right, it is indeed a misquote. The Gordon et al. survey states that "Downey et al. [10] showed that the problem of finding the shortest addition sequence is NP-complete," which I misread as "addition chain". I'll hunt around for more references and then fix the article(s). —Steven G. Johnson 22:16, 9 August 2007 (UTC)[reply]

I fixed it after nearly 2 years and made a concise wording shortest / minimal / optimal, hopefully. Regards, Achim1999 (talk) 15:00, 9 July 2009 (UTC)[reply]

Merger proposal

Is there anything in this article that could not be covered at Addition chain? Deltahedron (talk) 20:10, 25 July 2012 (UTC)[reply]