Randomized algorithms (intro) | Journey into cryptography | Computer Science | Khan Academy

Поделиться
HTML-код
  • Опубликовано: 26 окт 2024

Комментарии • 5

  • @roylee3196
    @roylee3196 9 лет назад +4

    It is confusing at the beginning, because you are jumping here and there (example: 1:57 , is that little circle denotes as a collection or one of the 2 sets? but nevertheless this is a great video and thanks for putting this up.

  • @ilovett
    @ilovett 10 лет назад +1

    Nice work Brit. I kept thinking I was looking at the Death Star though.

  • @sdineshp1
    @sdineshp1 9 лет назад

    maybe after doing 6k+/-1,, do divisibility test with small odd number set growing proportionally with k??

  • @kaivamannam5636
    @kaivamannam5636 3 года назад

    i thought a polynomial time primality test exist

  • @Alex-hb5pv
    @Alex-hb5pv 4 месяца назад

    The worst explanation that i ever saw/heard