Open Internet by MindsNet

Efficient Certification of Minimum Line Cover for Prime Points

The problem of finding the minimum number of straight lines needed to pass through every point, where points are plotted as (index, value) pairs of prime numbers, is a hard unsolved issue. This is an NP-complete weighted set cover problem that has a deep arithmetic structure. Previous approaches using generic MIP solvers have hit a wall due to the problem's complexity and the large search space.

Mathematics & logic, Mathematics, Number Theory