This is a news story, published by Quanta Magazine, that relates primarily to Yao news.
For more Yao news, you can click here:
more Yao newsFor more Ai research news, you can click here:
more Ai research newsFor more news from Quanta Magazine, you can click here:
more news from Quanta MagazineOtherweb, Inc is a public benefit corporation, dedicated to improving the quality of news people consume. We are non-partisan, junk-free, and ad-free. We use artificial intelligence (AI) to remove junk from your news feed, and allow you to select the best tech news, business news, entertainment news, and much more. If you like this article about Ai research, you might also like this article about
Tiny Pointers. We are dedicated to bringing you the highest-quality news, junk-free and ad-free, about your favorite topics. Please come every day to read the latest Hash tables news, less memory news, news about Ai research, and other high-quality news about any topic that interests you. We are working hard to create the best news aggregator on the web, and to put you in control of your news feed - whether you choose to read the latest news through our website, our news app, or our daily newsletter - all free!
PointersQuanta Magazine
•Technology
Technology
84% Informative
Andrew Krapivin invented a new kind of hash table, one that worked faster than expected.
The first hash tables date back to the early 1950s , and computer scientists have studied and used them ever since.
They’re designed to allow users to do exactly three things: search for an element, delete an element or insert one into an empty slot.
New paper refutes Yao ’s conjecture that, in the worst-case scenario, you can never do better than x.
In 1985 , Yao proved that hash tables with certain properties could never achieve an average time better than log x.
The new paper also contains what many consider an even more astonishing result: It doesn’t depend on x at all.
VR Score
89
Informative language
90
Neutral language
45
Article tone
informal
Language
English
Language complexity
42
Offensive language
not offensive
Hate speech
not hateful
Attention-grabbing headline
not detected
Known propaganda techniques
not detected
Time-value
long-living
External references
6
Affiliate links
no affiliate links
