ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Determine the optimal complexity of computing the volume of the union of axis-aligned boxes in fixed dimension at least three. In particular, is there a near-linear three-dimensional algorithm or an Ω(n3/2)\Omega(n^{3/2}) lower bound, and can fat or equal-sized boxes be handled faster?

Record

Added
Links

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.