The computational hardness conjecture for matroid branch-depth and c*-d*-depth
Statement
A matroid has branch-depth and cd-depth, two recursive depth parameters introduced in the paper. Computational hardness conjecture. Computing exactly the branch-depth and the cd-depth of matroids is -hard. The computational complexity of evaluating these parameters is not known; the conjecture predicts that both problems are computationally hard.
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.