Every source I can find just says "too big to be practical."

  • $\begingroup$ I'm not sure anyone ever computed it. By the way, what constant are you looking for ? The constant for the number of multiplications ? Arithmetic operations ? Etc. $\endgroup$
    – GBat
    Jul 30 '20 at 21:33
  • $\begingroup$ Arithmetic operations I suppose. Just to get some idea what the order of magnitude would be for CW and similar algorithms. $\endgroup$ Jul 30 '20 at 22:34
  • 3
    $\begingroup$ Someone has definitely computed an upper bound on the leading constant for the number of arithmetic ops, but I do not remember who (it was submitted to a conference years ago) and I am not sure the writeup was ever made public... I will check. My recollection is that it was < 10^(500)... $\endgroup$ Jul 31 '20 at 23:02
  • $\begingroup$ @RyanWilliams No luck? $\endgroup$ Aug 24 '20 at 17:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.