Problemadvanced
Set disjointness problem
Also called DISJ, set intersection problem.
Decide whether two sets held by Alice and Bob intersect; the central problem for lower bounds.
Decide whether two sets held by Alice and Bob intersect; the central problem for lower bounds.
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 3760MB Edit this page History Report an error