Complexity of testing reachability in matroids
From MaRDI portal
Recommendations
Cites work
- A characterisation of binary transversal structures
- A note on closure properties of logspace MOD classes
- Computational Complexity
- Connectivity in Matroids
- Gammoids and transversal matroids
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 1256731 (Why is no real title available?)
- Inequivalent Representations of Bias Matroids
- Matroid Complexity and Nonsuccinct Descriptions
- Maze recognizing automata and nondeterministic tape complexity
- On the Abstract Properties of Linear Dependence
- Problems complete for deterministic logarithmic space
- Reachability Problems: An Update
- Space-bounded reducibility among combinatorial problems
Cited in
(4)
This page was built for publication: Complexity of testing reachability in matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191148)