P
Initializing...
Theorem 4 — a schedule with makespan at most 3 exists iff the 3-dimensional matching instance has a matching · Prove2Me