Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?

DOI10.2307/2318871MaRDI QIDQ3405831zbMATH OpenOpenAlexFDO

Authors Victor Klee

Publication date 11 February 2010

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2318871

Mathematics Subject Classification ID

Classical measure theory (28A99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(18)

• Efficient covariance matrix update for variable metric evolution strategies
• A (slightly) faster algorithm for Klee's measure problem
• Approximate counting in SMT and value estimation for probabilistic programs
• Computing the depth distribution of a set of boxes
• Online algorithms for the maximum \(k\)-interval coverage problem
• Computing Klee's measure of grounded boxes
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• An improved algorithm for Klee's measure problem on fat boxes
• scientific article; zbMATH DE number 7278047 (Why is no real title available?)
• Calculation of discrepancy measures and applications
• Ectropy of diversity measures for populations in Euclidean space
• Klee's measure problem made oblivious
• Random sequential adsorption of aligned rectangles with two discrete orientations: finite-size scaling effects
• Improved streaming algorithm for the Klee's measure problem and generalizations
• On the quantum time complexity of divide and conquer
• An in-place algorithm for Klee's measure problem in two dimensions
• Efficient transformations for Klee's measure problem in the streaming model
• Approximating the volume of unions and intersections of high-dimensional geometric objects

This page was built for publication: Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405831)