ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let BestStep\mathtt{BestStep} denote the problem of computing an optimal next step for the online covering problem for the time-dependent biased random walk on a graph. BestStep hardness conjecture. For undirected graphs, BestStep\mathtt{BestStep} is PSPACE⁡\operatorname{PSPACE}-hard.

The paper proves PSPACE⁡\operatorname{PSPACE}-hardness for directed graphs and only NP⁡\operatorname{NP}-hardness for undirected graphs. Thus the undirected-graph claim remains open.

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 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.