A2.E – Scheduling Lower Bounds via AND Subset Sum
Why the open web links it
Presents new lower bounds for scheduling problems using reductions from AND Subset Sum.
Linked by 2 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including mpg.de, mpi-sws.org.