Algorithm Search⌘K

Techniqueadvanced

Converting Las Vegas to Monte Carlo

Also called Las Vegas truncation.

Stop a Las Vegas algorithm after a time bound; Markov's inequality then bounds the error probability of the resulting Monte Carlo algorithm.

Stop a Las Vegas algorithm after a time bound; Markov's inequality then bounds the error probability of the resulting Monte Carlo algorithm.

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
  • one source with a locator