{"id":2175,"date":"2025-08-16T10:10:10","date_gmt":"2025-08-16T10:10:10","guid":{"rendered":"https:\/\/www.europesays.com\/ie\/2175\/"},"modified":"2025-08-16T10:10:10","modified_gmt":"2025-08-16T10:10:10","slug":"chinas-tsinghua-university-helps-to-break-40-year-old-maths-cap-on-computer-speed","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/ie\/2175\/","title":{"rendered":"China\u2019s Tsinghua University helps to break 40-year-old maths cap on computer speed"},"content":{"rendered":"<p>Chinese computer scientists have solved a 40-year-old mathematics bottleneck, an advance that might help boost performance in hi-tech areas ranging from chip design and telecommunications to <a target=\"_self\" class=\"e1yy41x40 ef9u0v01 css-1ankfgb ecgc78b0\" href=\"https:\/\/www.scmp.com\/news\/china\/military\/article\/3321451\/chinas-wing-loong-2-multi-role-uav-workhorse-overseas-advantage?module=inline&amp;pgtype=article\" title=\"\" data-qa=\"BaseLink-renderAnchor-StyledAnchor\" rel=\"nofollow noopener\">drone navigation<\/a>.<\/p>\n<p datatype=\"p\" data-qa=\"Component-Component\" class=\"e8zc9q40 css-1c6uqr6 ec74h0k1\">One of the most fundamental problems in theoretical computer science is finding the shortest or most efficient path from one starting point to every other point in a network. This problem is known as the \u201csingle-source shortest-paths\u201d problem (SSSP).<\/p>\n<p datatype=\"p\" data-qa=\"Component-Component\" class=\"e8zc9q40 css-1c6uqr6 ec74h0k1\">For decades, the most famous and reliable method to overcome this has been Dijkstra\u2019s algorithm, which repeatedly searches for the shortest path for each segment, continuously comparing and sorting the points until reaching its destination. Yet this sorting step has an unavoidable speed limit.<\/p>\n<p datatype=\"p\" data-qa=\"Component-Component\" class=\"e8zc9q40 css-1c6uqr6 ec74h0k1\">A new approach devised by a group of young Chinese scientists promises to overcome the barrier, by skipping the sorting process and focusing only on the shortest distance between the most important points, thus greatly reducing calculation time.<\/p>\n<p datatype=\"p\" data-qa=\"Component-Component\" class=\"e8zc9q40 css-1c6uqr6 ec74h0k1\">The study, led by associate professor Duan Ran\u2019s research team at the Institute for Interdisciplinary Information Sciences (IIIS) at Tsinghua University, was published last month on arXiv, an open-access platform for preprint papers that are yet to be peer reviewed.<\/p>\n<p datatype=\"p\" data-qa=\"Component-Component\" class=\"e8zc9q40 css-1c6uqr6 ec74h0k1\">This development also won the Best Paper Award at the ACM Symposium on Theory of Computing or STOC, held in Prague in June.<\/p>\n<p><img decoding=\"async\" alt=\"The key to the \u201csingle-source shortest-paths\u201d or SSSP problem breakthrough is a combination of Dijkstra\u2019s algorithm with the Bellman-Ford algorithm. Photo: Shutterstock\" data-qa=\"BaseImage-handleRenderImage-StyledImage\" class=\"e1gf69pb2 css-6ikqhs e445x7d0\" loading=\"lazy\" src=\"https:\/\/www.europesays.com\/ie\/wp-content\/uploads\/2025\/08\/5425249b-e071-400d-8bfd-10ddd0bd0c07_561ae0f1.jpg\" title=\"The key to the \u201csingle-source shortest-paths\u201d or SSSP problem breakthrough is a combination of Dijkstra\u2019s algorithm with the Bellman-Ford algorithm. Photo: Shutterstock\"\/>The key to the \u201csingle-source shortest-paths\u201d or SSSP problem breakthrough is a combination of Dijkstra\u2019s algorithm with the Bellman-Ford algorithm. Photo: Shutterstock<\/p>\n","protected":false},"excerpt":{"rendered":"Chinese computer scientists have solved a 40-year-old mathematics bottleneck, an advance that might help boost performance in hi-tech&hellip;\n","protected":false},"author":2,"featured_media":2176,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[262],"tags":[2628,2629,2631,2627,2625,2638,314,2632,2637,2641,18,19,2640,17,2626,2639,2630,2635,2633,2634,82,2636],"class_list":{"0":"post-2175","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-computing","8":"tag-acm-symposium-on-theory-of-computing-stoc","9":"tag-arxiv","10":"tag-bellman-ford","11":"tag-best-paper-award","12":"tag-chinese-scientists","13":"tag-chip-design","14":"tag-computing","15":"tag-dijkstras-algorithm","16":"tag-drone-navigation","17":"tag-duan-ran","18":"tag-eire","19":"tag-ie","20":"tag-institute-for-interdisciplinary-information-sciences-iiis","21":"tag-ireland","22":"tag-mao-xiao","23":"tag-prague","24":"tag-princeton-university","25":"tag-quanta-magazine","26":"tag-robert-tarjan","27":"tag-stanford-university","28":"tag-technology","29":"tag-tsinghua-university"},"share_on_mastodon":{"url":"","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts\/2175","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/comments?post=2175"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts\/2175\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/media\/2176"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/media?parent=2175"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/categories?post=2175"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/tags?post=2175"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}