An FPTAS for the Knapsack Problem

Поділитися
Вставка
  • Опубліковано 25 сер 2024

КОМЕНТАРІ • 9

  • @Th0rmator
    @Th0rmator 2 роки тому +3

    Very nice explanation, easy to follow.

  • @user-wg5oq3xj5n
    @user-wg5oq3xj5n 8 місяців тому

    It’s been enjoyable journey into the Complexity theory. Thank you Matthias

  • @nikonru3287
    @nikonru3287 8 місяців тому

    Really nice course, I watched it with interest and joy.

  • @97edut
    @97edut 3 роки тому +1

    amazing proof! thank you!

  • @user-ge8lh5gb5b
    @user-ge8lh5gb5b Рік тому

    Really easy to follow and clearly explained. Excellent videos!
    A minor nitpick: I don't remember there is an example of a P problem, would be nice to know some of them. Also maybe discuss about complete problems for other classes of problems than NP. Maybe there are no complete problem for RP or maybe it is not known if it exists, just make some comments in this case.

  • @jasonzuang7718
    @jasonzuang7718 Рік тому

    Awesome Video!

  • @manuelaayo4199
    @manuelaayo4199 Рік тому

    Thank you for your explanation !
    Got a question. If you added another item of value 134 833, rounding it would still give you 200 000. On that case, how can you distinguish the 2 objects ?

    • @compscilessons
      @compscilessons  Рік тому +1

      If they have different weights, they will still be different. If they have the same weight, we do not have to distinguish them. In the solution, you will either decide to pick both, only one of them, or none. If the solution only includes one of them, you are free to pick either one and the gurantee on the total value of the solution will hold whatever choice you make. Of course, you might as well select the more valuable of the two, which would be 134,833 in this case.

  • @fjdk6009
    @fjdk6009 Рік тому

    I want to learn this kind of mathematics. Do I need to study basic subjects to start this course?