Beyond Computation: The P versus NP question

แชร์
ฝัง
  • เผยแพร่เมื่อ 30 ก.ย. 2024

ความคิดเห็น • 5

  • @dlbattle100
    @dlbattle100 7 ปีที่แล้ว +2

    FFS quit playing with the camera.

  • @dlbattle100
    @dlbattle100 7 ปีที่แล้ว +1

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

  • @ytpah9823
    @ytpah9823 ปีที่แล้ว

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

  • @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.

  • @ytpah9823
    @ytpah9823 ปีที่แล้ว

    Clique is not that hard