Can all-pairs shortest paths be computed in strongly sub-cubic time, that is, in time O(V3−ϵ) for some ϵ > 0?

Open the “Other algorithmic problems” section on Wikipedia →

Source: List of unsolved problems in computer science (CC BY-SA 4.0)