NP Completeness 1 - Introduction to Hard Problems

แชร์
ฝัง
  • เผยแพร่เมื่อ 8 ม.ค. 2025

ความคิดเห็น • 8

  • @hangxiaozhu5275
    @hangxiaozhu5275 2 ปีที่แล้ว +4

    Best Professor in the World

  • @husein_alfil
    @husein_alfil 2 ปีที่แล้ว +5

    Keep going ! 😃
    Great explanation and easy to follow.

  • @JikeWimblik
    @JikeWimblik หลายเดือนก่อน

    In sudoku If you call a group of possible numbers from all the possible numbers in a cell 1, then the dance of the 1's can begin. There should be x(how many numbers in your grouping) per adjacent row column and sub grid and you can test your guess or multiple guesses at once against other groupings upgrading until you end up squeezing to many 1's into a row colmn or subgrid and find a conflict or you solve the grid if the grid is solvable. Magic is real see. This encoding might lead to a p time solution who knows.

  • @mahmoudkhaled6799
    @mahmoudkhaled6799 2 ปีที่แล้ว +1

    If we can solve traveling salesman we can decode decryption ?

  • @nathantum8463
    @nathantum8463 3 ปีที่แล้ว +2

    Where can I can get the lecture notes?

    • @ProfessorPainter
      @ProfessorPainter  3 ปีที่แล้ว +9

      They are currently only available for my students. I am working on making a personal webpage that will make them available for everyone!

    • @nathantum8463
      @nathantum8463 3 ปีที่แล้ว

      @@ProfessorPainter Thanks for the response. Looking forward to your website.

    • @cyberscientist9618
      @cyberscientist9618 22 วันที่ผ่านมา

      @@ProfessorPainter thanks for the amazing content and waiting for your website and notes.