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-; TRN: 94:009753-0186
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Post matching - a distributive analog of independent matching
New algorithms for linear k-matroid intersection and matroid k-parity problems
On infinite antichains of matroids
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:35922
New algorithms for linear k-matroid intersection and matroid k-parity problems
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:35922
On infinite antichains of matroids
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:35922