Problemadvanced
Greater-than problem
Also called GT.
Decide whether Alice's n-bit number exceeds Bob's; randomized cost is O(log n).
Decide whether Alice's n-bit number exceeds Bob's; randomized cost is O(log n).
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 YB6SSK Edit this page History Report an error