Problemresearch
Approximate counting
Also called approximate counting of combinatorial objects.
Estimating a count to within a multiplicative error, often via sampling.
Estimating a count to within a multiplicative error, often via sampling.
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 07J65C Edit this page History Report an error