Algorithmic versus axiomatic definitions of matroids
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 98-111
- https://doi.org/10.1007/bfb0120924
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The computational complexity of matroid propertiesMathematical Proceedings of the Cambridge Philosophical Society, 1980
- Lower bounds on the worst-case complexity of some oracle algorithmsDiscrete Mathematics, 1978
- Oracle Algorithms for Fixed-Point Problems — An Axiomatic ApproachPublished by Springer Nature ,1978