Anonymous user
Talk:Addition-chain exponentiation: Difference between revisions
Talk:Addition-chain exponentiation (view source)
Revision as of 06:11, 27 August 2011
, 12 years ago→Alternative "special objects" to using Matrices
Line 12:
: Maybe just drop the matrix part altogether? Finding shortest chains is enough of a problem in itself, plus it's not like we need even more matrix related tasks on RC. --[[User:Ledrug|Ledrug]] 05:05, 27 August 2011 (UTC)
I didn't immediately see this task as a ''finding the shortest chain'' kind of exercise. Basically I was looking at it from a practical point of view. In that here is a real problem, and have is a real application and/or test case. Hence a reason to solve it. Without a real problem, and a real test case the task would look naked.
Also it means that the test case can be described in the "present tense", rather then as an abstraction.
Having said all that... I also am nervous about the matrix manipulation as I think it is enough to scare off the majority of contributors. And (you are right) it isn't core to the task. Maybe the matrix exponentiation could be relegated to a Kudos as it is an important application of any such algorithm.
Maybe someone could reword the task as I am at a bit of a loss on exactly an alternative way of describing it.
BTW this problem is a nice (and at the same time nasty) little puzzle to work on.... ¢ Who needs Sudoku when you have rosettacode.org? Yay! Rack your brains, but possibly produce something beautiful & useful at the end. ¢
[[User:NevilleDNZ|NevilleDNZ]] 06:11, 27 August 2011 (UTC)
== Inefficient chain finding ==
| |||