TIL: The knapsack problem is "weakly" NP-complete. There exists algorithms to solve it in time linear in the numbers specifying the instance, but exponential in the length of (number of bits require to express) those numbers. https://en.wikipedia.org/wiki/Weak_NP-completeness
Arson does not help the cause.
---
RT @alex_zee
On the seventy-something-th day of Portland protests, some demonstrators have started a fire in the local police union HQ. https://twitter.com/griffinmalone6/status/1292352058914246657
https://twitter.com/alex_zee/status/1292352898811047937
Fitted N95 > cotton > fleece, bandana, knitted.
https://www.cnn.com/2020/08/08/us/duke-university-face-mask-test-trnd/index.html
There's a pandemic wave / virus particle duality joke in here somewhere.
TLDR: This number is for FULL professors, a very small fraction of teaching faculty.
---
RT @KevinReuning
Hey @PoliticoRyan and @renurayasam this is wrong.
https://twitter.com/KevinReuning/status/1291922814228930560
Does anyone have plain text of books by BIPOC authors? It's for string processing in my algorithms class. I'd use something like Du Bois (http://www.gutenberg.org/ebooks/408), but I don't want racial slurs to pop up.
RT @Noahpinion
oh fuck https://twitter.com/LindaStone/status/1291485552672481281
Best algorithms book?
Mathematical analysis: Cormen et al. https://en.wikipedia.org/wiki/Introduction_to_Algorithms
Java code: Sedgewick & Wayne https://algs4.cs.princeton.edu/home/
Organization of high-level concepts: Levitin https://www.pearson.com/us/higher-education/program/Levitin-Introduction-to-the-Design-and-Analysis-of-Algorithms-3rd-Edition/PGM223052.html
Free, online, interactive: OpenDSA https://opendsa-server.cs.vt.edu/
CS professor, game designer, and fire dancer ordinaire.