Algorithm Search⌘K

Problemcore

Dominance counting

Also called 2D dominance range counting, dominance query.

Count the points that dominate a query point in both coordinates, the basic two-dimensional counting case.

Count the points that dominate a query point in both coordinates, the basic two-dimensional counting case.

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