Beyond Computation: The P versus NP question

Поделиться
HTML-код
  • Опубликовано: 3 авг 2024
  • Michael Sipser, Massachusetts Institute of Technology
    simons.berkeley.edu/events/mic...

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

  • @ytpah9823
    @ytpah9823 10 месяцев назад

    There is an alternate way of "constructing" the factors, which is sort of like a limited search in a special field.

  • @dlbattle100
    @dlbattle100 7 лет назад +1

    Factoring is not np-complete, but yeah, a solution to clique would let you solve factoring.

  • @davidmassie3213
    @davidmassie3213 4 года назад

    What if you had a alcarythem to serch through and combine all the alcarythoms there are total and find the combanation that solves any probliam the quickest?? Lol if anyone knows what iam even saying please tell me lol.

  • @dlbattle100
    @dlbattle100 7 лет назад +2

    FFS quit playing with the camera.

  • @ytpah9823
    @ytpah9823 10 месяцев назад

    Clique is not that hard