emil-lp
Joined 1 year ago
Joined 1 year ago
Graph theory and algorithm engineering overlap a great deal. And not only in the directly graph theoretic terms like BFS, Dijkstra, Flow, etc, but also in that you need a good grasp of greedy algorithms, dynamic programming, divide and conquer, and several other general techniques.
On the positive side, suddenly there's a whole bunch of open problems!
19 hours. Don't blink.
From the very top of https://www.claymath.org/millennium-problems
In order to celebrate mathematics in the new millennium, The Clay Mathematics Institute of Cambridge, Massachusetts (CMI) established seven Prize Problems. The Prizes were conceived to record some of the most difficult problems with which mathematicians were grappling at the turn of the second millennium; to elevate in the consciousness of the general public the fact that in mathematics, the frontier is still open and abounds in important unsolved problems; to emphasize the importance of working towards a solution of the deepest, most difficult problems; and to recognize achievement in mathematics of historical magnitude.
It then goes into details in each of the chosen problems.
"""
The original meanings that enormity carried related to great wickedness, and some assert that enormity should today only be used with such meanings, and that enormousness is the proper word to use to mean "large size." Despite these claims, enormity frequently refers to large size, either literal or figurative, though it usually suggests something so large as to seem overwhelming.
"""
Did they start with OpenAI's Lean proof and continue work on that?
Does the Lean proof grow significantly, or are they also trying to keep the Lean proof short-ish?
But a news aggregator site is not DDoS-ing.
Eg see https://retractionwatch.com/2025/07/29/frontiers-retract-122...