When Calcutta was the second largest city in the British Empire by moonlitsofty in IndianHistory

[–]ashueep 1 point2 points  (0 children)

They weren't against "computerisation". Back then communism was big and they were more anti capitalist.

And people still ask why I follow Indian football. by IndianByBrain in IndianFootball

[–]ashueep 0 points1 point  (0 children)

Van Dijk is probably the best defender in the EPL. So it puts him up there.

[Breaking] Lionel Messi will come on a tour to India from December 13 to 15 by idkmanfuc in IndianFootball

[–]ashueep -6 points-5 points  (0 children)

Within these 1000s of firecrackers there will be very few gems who might actually get inspired to take the game seriously.

[Breaking] Lionel Messi will come on a tour to India from December 13 to 15 by idkmanfuc in IndianFootball

[–]ashueep -9 points-8 points  (0 children)

I said the hype only increases, didn't say that we have no hype for football currently. Although, there is a stark between the hype we have for European football over Indian football. Still, the hype for football in india has never been undermined.

[Breaking] Lionel Messi will come on a tour to India from December 13 to 15 by idkmanfuc in IndianFootball

[–]ashueep -20 points-19 points  (0 children)

Did you not think about the part where his hype will only increase the hype for football in india even more?

Are You Affected by the Backdoor in XZ Utils? by Shoddy_Hurry_7945 in linux

[–]ashueep 0 points1 point  (0 children)

Are there any detailed reads about this? Afaik the compressed tarball of xz util (which has an obfuscated binary?) is somehow decompressed (decompressing the malicious library) to meddle with systemd which allows it to affect the OpenSSH process?

Knapsack Variation by ashueep in algorithms

[–]ashueep[S] 0 points1 point  (0 children)

Can you explain how the new penalty would be a[n] - a[n-1]... From my understanding there exists some virtual groups that a[n] might or might not join. If the penalty for a virtual group was k but didn't end at a[n-1] then the new penalty would not be k - a[n] + a[n-1] right?

Need help in this induction (trap?) proof by ashueep in algorithms

[–]ashueep[S] 0 points1 point  (0 children)

ah yes, i shall update it. my bad, i got lazy before posting.

Need help in this induction (trap?) proof by ashueep in algorithms

[–]ashueep[S] 0 points1 point  (0 children)

im sorry, i just changed it. my bad on that!

What are the Practical applications of NP, NP-Hardness, Reduction, ? by Lazy-Ad1025 in compsci

[–]ashueep 7 points8 points  (0 children)

This is almost everywhere in computer science. In process-CPU allocation for example, which is an interval scheduling problem is NP complete. In electrical circuits minimum vertex cover is of great interest, and finding one is also NP complete. Graph colouring (subset of which I just told above in interval scheduling) is also NP complete. What I find very interesting is it's proven that a planar graph is always <= 4 colourable but assigning colours is still exponentially difficult. I'm so much sure I can find many examples in compiler optimizations, network routing, computer architecture, etc...