ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A matroid MM has branch-depth and c∗^*d∗^*-depth, two recursive depth parameters introduced in the paper. Computational hardness conjecture. Computing exactly the branch-depth and the c∗^*d∗^*-depth of matroids is NP\mathsf{NP}-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 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.