วีดีโอ

What a great video! I left a like. Could anyone help me with this? I store USDT TRX20 in my OKX wallet paired with the recovery phrase [ clean party soccer advance audit clean evil finish tonight involve whip action ] How can I move it to OKX or Binance?

Perfect explanation, Keep going 🌹

gross AI voice

Damn !

Crypto is the Wild West, but I’m all in!

Anyone else buying the dip? Now’s the time!

Thanks for the breakdown! I need some advice: My OKX wallet holds some USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). Could you explain how to move them to Binance?

Thank you so much for this amazing video! Could you help me with something unrelated: I have a SafePal wallet with USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). What's the best way to send them to Binance?

Sehr gut

Lovely visualizations

thank you sir

Thank you, intelligent persons, for sharing this for free!!!

Amazing video! i'll try to implement this in c#

Why the table columns are the values, not the volume?

Really clear explanation. Thanks for the video!

Thanks for this, it’s enough to get me started in zk

can you share the code?

I love the graphics. The artificial voice is distracting however.

The AI voice is very difficult to listen after the first few minutes.

Gemini 1.5 Pro: This video is about the Bin Packing Problem and how to solve it with an approximation algorithm. The video starts with a scenario where you are running a drone transportation company. The drone has a carrying capacity of one kilogram, and you want to pack the items into boxes as tightly as possible to save on the number of journeys. The items include an apple weighing 500 grams, an orange weighing 300 grams, 400 grams of strawberries, and 700 grams of grapes. The video then introduces a simple algorithm called First Fit. This algorithm considers the items in whatever order and places them into bins one by one. The goal is to place each item in the leftmost bin that it fits into. For example, with the items listed above, the first item would go into the first bin, the second item would not fit into the first bin so it goes into the second bin, and so on. This algorithm uses five bins in total. The video then analyses the First Fit algorithm and proves that it is a two approximation algorithm for bin packing. This means that the algorithm uses at most two times as many bins as the optimal solution. The video also discusses an improvement to the First Fit algorithm by sorting the elements in decreasing order. This improvement can achieve an approximation ratio of three over two. The video concludes by proving that it is NP-hard to approximate bin packing to any constant less than 1.5. This means that there is no polynomial time algorithm that can guarantee an approximation ratio better than 1.5. The video also mentions that First Fit with sorting is a 1.5-approximation algorithm.

Thanks for the good work!

Great explanation ❤❤❤…Thank u so much👌👌

Great video

You forgot to mention that the idea with the test program is we want the test program to output the opposite result of the halting program. Hence where you got the inner body of the program named 'test'. This is a key component you forgot to mention.

1st

what the fuck this is so good

I have been banging my head trying to understand the theory, but you made it very simple.! <3

thank you. well explained.

Incredibly high quality video, thank you very much!

the first example might be wrong. The number of letter different between top and down. How can rows be same?

AI

Best video on the subject with an additional proof of reduction, amazing help in the NP-Completeness world !!! Thanks a lot

There is no proof here. It’s zero proof.

Brilliant! I have absolutely no idea what's going on.

Very detailed video

thanks

Looks like series to me.

Alice and Bob will be together forever.

the best explanation ever, thanks man

idk what i'm doing here, i was just trying to learn how to draw a maze

This was a great explanation! Covered nearly everything I learnt in my class. The confusion matrix is, well, confusing but also quite logical.

Very clear and thorough explanation in such a short time, complete with application examples. More mechanism design videos please!

It is extending our brain. But we need more. Please make video which explains just algorithm then let us write code. Thanks.

Really cool video, I am writing a scientific work about cryptography and this video was extremely usefull

Thank you! waiting for a 3D Bin Packing video :)

very good video, you talk slowly that it is possible to understand, thanks!

Thank you for the beautiful explanation

great video

Waldo is behind the train in the bottom right corner

Damn this channel is so so good, I wonder why youtube does not recomend it for me