Polynomial Time Reductions (Algorithms 21)

Поделиться
HTML-код
  • Опубликовано: 18 дек 2024

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

  • @user-jz2hr7wh3x
    @user-jz2hr7wh3x 2 года назад +6

    This video is the best resource I have found regarding NP problems and polynomial time reductions.

  • @shadowsaber9958
    @shadowsaber9958 3 года назад +1

    Awesome explanation, thank you for your hard work!

  • @alieser7770
    @alieser7770 2 года назад

    Thank you so much professor!

  • @yunusisah9244
    @yunusisah9244 Месяц назад

    Good day, am having difficulties understanding how to point out the independent set and vertex cover from a graph

  • @tearex6124
    @tearex6124 Год назад

    quick question about the contrapositive. Is it possible for the translation from P to Q to be none polynomial even if Q has a polynomial algorithm solution?

  • @zxoowoo6094
    @zxoowoo6094 2 года назад

    Hope professor can upload more works, your info is very detailed

  • @汪立雯-u3b
    @汪立雯-u3b 2 года назад

    沒有朋友

  • @zxoowoo6094
    @zxoowoo6094 2 года назад +1

    review for my final