Characterize the input sequences that have the worst performance under the smoothed complexity of the caching problem, whose competitive-ratio complexity is of order log k for…
Statement
Characterize the input sequences that have the worst performance under the smoothed complexity of the caching problem, whose competitive-ratio complexity is of order log k for cache size k.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.