NP Completeness for The Clique Problem

Поделиться
HTML-код
  • Опубликовано: 6 окт 2024
  • Disclaimer: I did not produce this video, just found it (can't recall from where) and thought that it might be useful to others.

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

  • @prathmesh_shinde_
    @prathmesh_shinde_ 4 года назад +4

    CNF - conjunctive normal form, conjunction is 'and' operator

  • @bm-ub6zc
    @bm-ub6zc 4 года назад +2

    very good! there's only one mistake: the first two clauses should be connected by an ^ and not by an v

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

    at @8:41 you have an or in between the first two clauses

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

    Thanks! Helpful explanation!

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

    Clear as water! thank you!

  • @flutterman2149
    @flutterman2149 4 года назад

    Very helpful video! I was trying to understand the proof from the book, but it is waaay too long :)

  • @jishudas2714
    @jishudas2714 7 лет назад

    good one

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

    You repeat the same thing 10 times

  • @aash647
    @aash647 8 лет назад

    hey..! may know which hardware are you using to write. thank you

  • @jesusdiv18
    @jesusdiv18 7 лет назад +1

    Waste of time