Theoremcore
Brent's theorem
Also called Brent's lemma, greedy scheduling bound.
Any greedy schedule on p processors runs in time at most T1/p + T-infinity.
Any greedy schedule on p processors runs in time at most T1/p + T-infinity.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag XNKPT4 Edit this page History Report an error