Hi, I have an algorithm that has pieces that perform computations on Z/ p^i*Z for different values of i. I can count the operations for each piece, but to have an overall complexity, I need to know how the difference pieces compare.
So, can anyone tell me how many bit operations are performed, in Sage, in a product of two elements of Z/n*Z (in terms of n and size of the input)? (I am particularly interested in cases where n=p^i for various i's, but it would be nice to know in general for future reference.) What about in Z? (A general reference would be fine too, of course.) Thanks, Luis -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
