
























Abstract:Standard analyses of expected runtimes for randomized algorithms typically bypass the explicit construction of an underlying probability space. In this paper, we provide a formal, yet intuitive tree-based definition of the probability space for the execution paths of such algorithms. Using this model, we derive the recurrence equation for the expected runtime.
From: George Nadareishvili [view email]
[v1]
Sat, 5 Apr 2025 10:50:53 UTC (8 KB)
[v2]
Thu, 19 Jun 2025 18:36:07 UTC (8 KB)
[v3]
Sat, 27 Jun 2026 10:36:57 UTC (15 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。