ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Cn,mQFWC^{QFW}_{n,m} denote the total cost of the Quick-Find-Weighted algorithm through its first mm mergers, and let \build⟶L2\build{\longrightarrow }{}_{\mathcal L_2} denote convergence in L2L^2. Quick-Find-Weighted cost conjecture.

Cn,n−1QFWnlog⁡n\build⟶L21π.\frac{C^{QFW}_{n,n-1}}{n \log n} \build{\longrightarrow }{}_{\mathcal L_2} \frac{1}{\pi}.

The conjecture predicts a precise asymptotic constant for the total cost of Quick-Find-Weighted. The analogous result for Quick-Find-Biased, with limiting constant 1/21/2, is proved in the preceding theorem; the authors also expect a smaller variance for Quick-Find-Weighted but do not provide a proof.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.