Independence and port oracles for matroids, with an application to computational learning theory
- 1 June 1996
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 16 (2) , 189-208
- https://doi.org/10.1007/bf01844845
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An algorithm to learn read-once threshold formulas, and transformations between learning modelscomputational complexity, 1994
- Learning read-once formulas with queriesJournal of the ACM, 1993
- Computational limitations on learning from examplesJournal of the ACM, 1988
- An Almost Linear-Time Algorithm for Graph RealizationMathematics of Operations Research, 1988
- On the Uniqueness of Matroid Representations Over GF(4)Bulletin of the London Mathematical Society, 1988
- Complexity of Matroid Property AlgorithmsSIAM Journal on Computing, 1982
- Converting Linear Programs to Network ProblemsMathematics of Operations Research, 1980
- The matroids with the max-flow min-cut propertyJournal of Combinatorial Theory, Series B, 1977
- A note on the production of matroid minorsJournal of Combinatorial Theory, Series B, 1977
- A Solution of the Shannon Switching GameJournal of the Society for Industrial and Applied Mathematics, 1964