{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T11:13:41Z","timestamp":1771413221184,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01844845","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T20:55:52Z","timestamp":1121288152000},"page":"189-208","source":"Crossref","is-referenced-by-count":17,"title":["Independence and port oracles for matroids, with an application to computational learning theory"],"prefix":"10.1007","volume":"16","author":[{"given":"Collette R.","family":"Coullard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Hellerstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01844845_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"D. Angluin, L. Hellerstein, andM. Karpinski: Learning read-once formulas with queries,J. of the Association for Computing Machinery 40 (1993) 185\u2013210.","journal-title":"J. of the Association for Computing Machinery"},{"key":"BF01844845_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01205054","volume":"4","author":"N. Bshouty","year":"1994","unstructured":"N. Bshouty, T. Hancock, L. Hellerstein, andM. Karpinski: An algorithm to learn read-once threshold formulas, and transformations between learning models,Computational Complexity 4 (1994) 37\u201361.","journal-title":"Computational Complexity"},{"key":"BF01844845_CR3","unstructured":"R. E. Bixby: Matroids and operations research. in:Advanced Techniques in the Practice of Operations Research, (H. J. Greenberg, F. H. Murphy, and S. H. Shaw, eds.), North-Holland Publishers (1980) 333\u2013459."},{"key":"BF01844845_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","volume":"5","author":"R. E. Bixby","year":"1980","unstructured":"R. E. Bixby, andW. H. Cunningham: Converting linear programs to network problems,Mathematics of Operations Research 5 (1980) 321\u2013357.","journal-title":"Mathematics of Operations Research"},{"key":"BF01844845_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","volume":"13","author":"R. E. Bixby","year":"1988","unstructured":"R. E. Bixby, andD. K. Wagner: An almost linear time algorithm for graph realization,Mathematics of Operations Research 13 (1988) 99\u2013123.","journal-title":"Mathematics of Operations Research"},{"key":"BF01844845_CR6","first-page":"83","volume-title":"Teorie Combinatorie","author":"T. H. Brylawski","year":"1976","unstructured":"T. H. Brylawski, andD. Lucas: Uniquely representable combinatorial geometries,Teorie Combinatorie (Proc. 1973 Internat. Colloq.) 83\u2013104, Accademia nazionale dei Lincei, Rome, (1976)."},{"key":"BF01844845_CR7","unstructured":"D. Hausmann, andB. Korte: The relative strength of oracles for independence systems, in:Special Topics of Applied Mathematics, (J. Frehse, D. Pallaschke, and U Trottenberg, eds.), North-Holland Publishers (1980) 195\u2013211."},{"key":"BF01844845_CR8","unstructured":"L. Hellerstein, andC. Coullard: Learning binary matroid ports,Proceedings of the 5th Annual SIAM Symposium on Discrete Algorithms (1994) 328\u2013335."},{"issue":"1","key":"BF01844845_CR9","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0211014","volume":"11","author":"P. M. Jensen","year":"1982","unstructured":"P. M. Jensen andB. Korte: Complexity of matroid property algorithms,SIAM Journal of Computation,11 (1) (1982) 184\u2013190.","journal-title":"SIAM Journal of Computation"},{"key":"BF01844845_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1112\/blms\/20.1.5","volume":"20","author":"J. Kahn","year":"1988","unstructured":"J. Kahn: On the uniqueness of matroid representations over GF(4).Bull. London Math Soc. 20 (1988) 5\u201310.","journal-title":"Bull. London Math Soc."},{"key":"BF01844845_CR11","unstructured":"M. Kearns, M. Li, L. Pitt, andL. Valiant: On the learnability of boolean formulae,Proc. 19th ACM Symposium on Theory of Computing (1987) 285\u2013295."},{"key":"BF01844845_CR12","unstructured":"M. Kearns, andL. Valiant: Cryptographic limitations on learning boolean formulae and finite automata,Proc. 21st ACM Symposium on Theory of Computing (1989) 433\u2013444."},{"issue":"4","key":"BF01844845_CR13","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0112059","volume":"12","author":"A. Lehman","year":"1964","unstructured":"A. Lehman: A solution of the Shannon switching game,Journal of the Society of Industrial and Applied Mathematics 12:4 (1964) 687\u2013725.","journal-title":"Journal of the Society of Industrial and Applied Mathematics"},{"key":"BF01844845_CR14","volume-title":"Matroid Theory","author":"J. G. Oxley","year":"1992","unstructured":"J. G. Oxley:Matroid Theory, Oxford University Press, New York, (1992)."},{"key":"BF01844845_CR15","series-title":"Technical Report","volume-title":"On inequivalent representations of matroids over finite fields","author":"J. G. Oxley","year":"1994","unstructured":"J. G. Oxley, D. Vertigan, andG. Whittle: On inequivalent representations of matroids over finite fields, Technical Report, Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803, (1994)."},{"key":"BF01844845_CR16","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"L. Pitt, andL. Valiant: Computational limitations on learning from examples,J. ACM 35 (1988) 965\u2013984.","journal-title":"J. ACM"},{"key":"BF01844845_CR17","unstructured":"V. Raghavan, andS. Schach: Learning switch configurations,Proceedings of Third Annual Workshop on Computational Learning Theory Morgan Kaufmann Publishers (1990) 38\u201351."},{"key":"BF01844845_CR18","unstructured":"V. Raghavan, andD. Wilkins: Learning \u03bc-branching programs with queries,Proceedings of the Sixth Annual Workshop on Computational Learning Theory, ACM Press (1993) 27\u201336."},{"issue":"2","key":"BF01844845_CR19","first-page":"356","volume":"12","author":"P. D. Seymour","year":"1975","unstructured":"P. D. Seymour: The forbidden minors of binary clutters,J. London Math. Soc. (2)12 (1975) 356\u2013360.","journal-title":"J. London Math. Soc."},{"key":"BF01844845_CR20","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0095-8956(77)90077-6","volume":"22","author":"P. D. Seymour","year":"1977","unstructured":"P. D. Seymour: A note on the production of matroid minors,J. of Combinatorial Theory (B) 22 (1977) 289\u2013295.","journal-title":"J. of Combinatorial Theory (B)"},{"key":"BF01844845_CR21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"P. D. Seymour","year":"1977","unstructured":"P. D. Seymour: The matroids with the max-flow min-cut property,J. of Combinatorial Theory (B) 23 (1977) 189\u2013222.","journal-title":"J. of Combinatorial Theory (B)"},{"key":"BF01844845_CR22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02579179","volume":"1","author":"P. D. Seymour","year":"1981","unstructured":"P. D. Seymour: Recognizing graphic matroids,Combinatorica 1 (1981) 75\u201378.","journal-title":"Combinatorica"},{"key":"BF01844845_CR23","volume-title":"Matroid Decomposition","author":"K. Truemper","year":"1992","unstructured":"K. Truemper:Matroid Decomposition, Academic Press, San Diego, (1992)."},{"key":"BF01844845_CR24","first-page":"905","volume":"11","author":"W. T. Tutte","year":"1960","unstructured":"W. T. Tutte: An algorithm for determining whether a given binary matroid is graphic,Proc. Amer. Math. Soc. 11 (1960) 905\u2013917.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF01844845_CR25","volume-title":"Matroid Theory","author":"D. J. A. Welsh","year":"1976","unstructured":"D. J. A. Welsh:Matroid Theory, Academic Press, London, (1976)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01844845.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01844845\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01844845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T21:04:17Z","timestamp":1557435857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01844845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01844845"],"URL":"https:\/\/doi.org\/10.1007\/bf01844845","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}