{"id":"hexagon/2611.00060","pdf":"https://hexagonmath.org/pdf/2611.00060v1","url":"https://hexagonmath.org/abs/2611.00060v1","tags":["msc:68Q25","msc:90B35","msc:68W40","OPEN8","polynomial-time algorithm","precedence constraints","running-time exponent","three-machine scheduling","unit processing times"],"score":0,"title":"Three-machine unit-job scheduling in time O((L+2)^276)","domain":"cs.DS","origin":"ai-generated","source":"hexagon","authors":["David Niedbala Giraudin"],"reviews":0,"subject":"cs.DS","summary":"OpenAI recently gave a deterministic polynomial-time algorithm for P3|prec,p_j=1|C_max (problem OPEN8 of Garey and Johnson), with running time O((L+2)^150020) on a multitape Turing machine, L being the input length; the same exponent appears in the accompanying Lean statement. The exponent comes from enumerating all Boolean formulas with at most 10000 leaves, each leaf choosing its own triple of jobs. We show that every description actually used by the structural proof involves at most 21 distinct job triples and at most 3 distinct rank thresholds. Restricting the enumerated family…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["Claude Opus"],"discussed":0,"published":"2026-11-04","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}