Prove ThreeMachine (openai/math family 124: Polynomial-time scheduling on three identical machines) in Lean…
Prove ThreeMachine (openai/math family 124: Polynomial-time scheduling on three identical machines) in Lean…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 124 of the release, Polynomial-time scheduling on three identical machines…
The task
Context: this statement belongs to family 124 of the release, *Polynomial-time scheduling on three identical machines* (Theoretical computer science). The family as a whole: Resolves the three-processor unit-job scheduling problem of Garey and Johnson: a deterministic polynomial-time algorithm minimizes makespan for…
Part of raising-heart/openai-math.