Pith. sign in

How often should you clean your room?

1 Pith paper cite this work, alongside 171 external citations. Polarity classification is still indexing.

1 Pith paper citing it
171 external citations · Pith
abstract

We introduce and study a combinatorial optimization problem motivated by the question in the title. In the simple case where you use all objects in your room equally often, we investigate asymptotics of the optimal time to clean up in terms of the number of objects in your room. In particular, we prove a logarithmic upper bound, solve an approximate version of this problem, and conjecture a precise logarithmic asymptotic.

fields

cs.HC 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.