Beyond Computation: The P versus NP question

Michael Sipser, Massachusetts Institute of Technology
simons.berkeley.edu/events/mic...

Пікірлер: 5

  • @ytpah9823
    @ytpah982310 ай бұрын

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

  • @davidmassie3213
    @davidmassie32134 жыл бұрын

    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
    @dlbattle1007 жыл бұрын

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

  • @dlbattle100
    @dlbattle1007 жыл бұрын

    FFS quit playing with the camera.

  • @ytpah9823
    @ytpah982310 ай бұрын

    Clique is not that hard