First improvement of fundamental algorithm in 10 years
The max-flow problem, which is ubiquitous in network analysis, scheduling, and logistics, can now be solved more efficiently than ever.
The mission of MIT is to advance knowledge and educate students in science, technology and other areas of scholarship that will best serve the nation and the world in the 21st century.
Visit web.mit.edu → On Hacker News Aug 2008 – Dec 2023
Tech Industry & Business 21Society, Policy & Culture 7Math & Algorithms 7Science & Space 5Software Engineering 3History & Retro Computing 3
The max-flow problem, which is ubiquitous in network analysis, scheduling, and logistics, can now be solved more efficiently than ever.
For a large range of practically useful cases, MIT researchers find a way to increase the speed of one of the most important algorithms in the information sciences.
A new information-theoretical model of human sensory perception and memory sheds light on some peculiarities of the nervous system.
Interactive proofs — mathematical games that underlie much modern cryptography — work even if players try to use quantum information to cheat.
A new technique for solving ‘graph Laplacians’ is drastically simpler than its predecessors, with implications for a huge range of practical problems.