Timeline for Counting multiplications (complexity function)
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 11, 2013 at 9:58 | answer | added | user201018 | timeline score: 1 | |
May 24, 2013 at 2:51 | vote | accept | user587155 | ||
May 23, 2013 at 23:22 | answer | added | DavidC | timeline score: 14 | |
May 23, 2013 at 23:18 | answer | added | Thies Heidecke | timeline score: 8 | |
May 23, 2013 at 23:16 | comment | added | Michael E2 | I wonder if Mathematica might be able to simplify the terrible algebraic expression for you -- but that's a different question. | |
May 23, 2013 at 23:04 | comment | added | user587155 |
thanks for the input. indeed, counting * in the InputForm string is most in line with what i originally hoped to accomplish, thanks!
|
|
May 23, 2013 at 22:40 | answer | added | Oleksandr R. | timeline score: 11 | |
May 23, 2013 at 22:26 | comment | added | rm -rf♦ |
"but that seems like an unnecessarily cumbersome way." — unless I'm mistaken, that seems to be the only sensible option, since with the Flat attribute of Times , you'll never see Times[a, Times[b, c]] . There might be dark, back alley routes to spelunk and do some ugly pre-parsing, etc., but I don't think it'd be any less "cumbersome", not to mention the loss in intent and clarity. As an alternative, you could consider converting your expression to InputForm , then a string and counting the * s
|
|
May 23, 2013 at 22:18 | review | First posts | |||
May 23, 2013 at 22:35 | |||||
May 23, 2013 at 22:02 | history | asked | user587155 | CC BY-SA 3.0 |