Beyond Computation: The P versus NP question

preview_player
Показать описание
Michael Sipser, Massachusetts Institute of Technology
Рекомендации по теме
Комментарии
Автор

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

ytpah
Автор

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

dlbattle
Автор

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.

davidmassie