The undirected BestStep PSPACE-hardness conjecture
Statement
Let 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, is -hard.
The paper proves -hardness for directed graphs and only -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.