Independence and port oracles for matroids, with an application to computational learning theory
type: Item
instance of: scholarly article
title: Independence and port oracles for matroids, with an application to computational learning theory
zbMATH Open document ID: 0860.05019
DOI: 10.1007/BF01844845
author: Collette R. Coullard
author: Lisa Hellerstein
published in: Combinatorica
publication date: 1996-11-24T00:00:00Z
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 936870
zbMATH Keywords: matroid
zbMATH Keywords: port oracle
zbMATH Keywords: ear decomposition
zbMATH Keywords: computational learning theory
zbMATH Keywords: membership queries
zbMATH Keywords: algorithm
zbMATH Keywords: testing independence
MaRDI profile type: Publication
cites work: Learning read-once formulas with queries
cites work: An algorithm to learn read-once threshold formulas, and transformations between learning models
cites work: Converting Linear Programs to Network Problems
cites work: An Almost Linear-Time Algorithm for Graph Realization
cites work: Q4173891
cites work: Q3924224
cites work: Q3128892
cites work: Complexity of Matroid Property Algorithms
cites work: On the Uniqueness of Matroid Representations Over GF(4)
cites work: A Solution of the Shannon Switching Game
cites work: On inequivalent representations of matroids over finite fields
cites work: Computational limitations on learning from examples
cites work: The Forbidden Minors of Binary Clutters
cites work: A note on the production of matroid minors
cites work: The matroids with the max-flow min-cut property
cites work: Recognizing graphic matroids
cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic
description: scientific article; zbMATH DE number 936870