Algorithm Search⌘K

Problemintro

Approximate counting problem

Also called approximate counter, counting with few bits.

Maintain an approximate count of events using far fewer bits than an exact counter.

Maintain an approximate count of events using far fewer bits than an exact counter.

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.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator