The computational complexity of matroid properties
- 1 January 1980
- journal article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 87 (1) , 29-45
- https://doi.org/10.1017/s0305004100056498
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Packings of graphs and applications to computational complexityJournal of Combinatorial Theory, Series B, 1978
- Oracle Algorithms for Fixed-Point Problems — An Axiomatic ApproachPublished by Springer Nature ,1978
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976
- A generalization and proof of the Aanderaa-Rosenberg conjecturePublished by Association for Computing Machinery (ACM) ,1975
- Random matroidsDiscrete Mathematics, 1975
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965