Cat@ponder.cat to Technology@lemmy.worldEnglish · 12 days agoA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgexternal-linkmessage-square50fedilinkarrow-up1380arrow-down119cross-posted to: [email protected]
arrow-up1361arrow-down1external-linkA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgCat@ponder.cat to Technology@lemmy.worldEnglish · 12 days agomessage-square50fedilinkcross-posted to: [email protected]
minus-squarebarsoap@lemm.eelinkfedilinkEnglisharrow-up2·10 days agoWhen you have a paper that’s pretty much a succession of “Lemma:” “Proof:” “Theorem:” and “Proof:” and no benchmark chart then yes it’s a theoretical one.
When you have a paper that’s pretty much a succession of “Lemma:” “Proof:” “Theorem:” and “Proof:” and no benchmark chart then yes it’s a theoretical one.