2 ms·
It is kind of funny. A couple of times articles on HN about complexity theory with assumed knowledge of terms like P-time or NP-hard. In these instances some co
by madsbuch 4y ago
It is kind of funny. A couple of times articles on HN about complexity theory with assumed knowledge of terms like P-time or NP-hard. In these instances some commenters complained that they could not easily understand what it meant.
I really had to read closely to understand that this is about chip design.
- dtjb 4y agoA quirk of HNs rule, post title must match article title. If nothing else it gets more people to RTA.
- layer8 4y agoThe article mentions chips, stacking, packaging, memory and yield in the second paragraph, and foundries, dies, silicon, ICs and PCBs in the third (and that’s just 10% into the article), I thought it was obvious pretty quickly.
- madsbuch 4y agoI agree, as I also had not problem understanding that is was about complexity theory when I see the term NP-hard.