Decision Problems - Intro to Theoretical Computer Science

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

Tractable: if a problem is complete in deterministic polynomial time
Q1:intractable
Q2: can't say
Q3:can't say
Q4: tractable

PrashantSharma
Автор

For the Quiz Answer for Q2 and Q3 is can't say...

bimalendusarma
Автор

the video image is too poor, you need to fix it more

longduongdinh