Learning binary matroid ports
Conference
·
OSTI ID:35922
Given a binary matroid M specified by a port oracle, we can in polynomial number of calls to the oracle construct a binary representation for M. For general matroids, we can in polynomial number of calls to a port oracle determine whether a given subset is independent (that is, we can simulate an independence oracle with a port oracle). The work is related to a theorem of Lehman on matroid ports, and is motivated by issues in computational learning theory.
- OSTI ID:
- 35922
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Post matching - a distributive analog of independent matching
On infinite antichains of matroids
Efficient algorithms for robustness in matroid optimization
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36379
On infinite antichains of matroids
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35951
Efficient algorithms for robustness in matroid optimization
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:471723