Open problems. We point out only a few of the many open problems remaining in the area.
Statement
Open problems. We point out only a few of the many open problems remaining in the area. What about d-ary trees? • For pn < 1.1, is it possible to detect an unknown random tree of size O(log n)? • Can our method (the hairy-path test ) be performed in polynomial time? The report passage is retained verbatim as the relevant context for this extracted problem.
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.