Np-Complete Problems | Reduction Theory | Np and Np Hard Problem

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

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

  • @saurabhkhule1296
    @saurabhkhule1296 3 года назад

    perfect explaination...was so confused about this topic before...Now i got it...thnx

  • @wcnuderful
    @wcnuderful 3 года назад

    best explanation so far

  • @rituchandna4268
    @rituchandna4268 6 лет назад +1

    Np problem are those who can't be solve in polynomial time but assume that it will HV some optimal solution near by the actual optimal solution?

    • @CodingBlocksIndia
      @CodingBlocksIndia  6 лет назад

      For finding the nearest optimal solution we take the help of approximation algorithms. This will be covered in the later videos of the series

    • @rituchandna4268
      @rituchandna4268 6 лет назад

      Coding Blocks india👍

  • @surojitmondal2453
    @surojitmondal2453 5 лет назад +3

    your voice is very low
    plz if you will make video in future use microphone.

  • @anjankailash6145
    @anjankailash6145 6 лет назад +2

    Hey

  • @sf-vo4nn
    @sf-vo4nn 4 года назад

    iam not understand no use