Miroslav Rada, Michal CernĂ½, Ondrej Sokol. The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability. Computational Complexity, 33(2):8, December 2024. [doi]
Abstract is missing.