Matroid complexity and non-succinct descriptions
| dc.creator | Mayhew, Dillon | |
| dc.date | 2007-02-20 | |
| dc.date | 2007-09-10 | |
| dc.date.accessioned | 2026-07-07T08:28:17Z | |
| dc.date.available | 2026-07-07T08:28:17Z | |
| dc.description | We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems under this scheme appears to be highly dependent on the choice of input-type. We define an order on the various methods of description, and we show how this order acts upon ten types of input. We also show that under this approach several natural algorithmic problems for matroids are complete in classes thought not to be equal to P. | |
| dc.description | 16 pages, 1 figure. Title changed, proofs simplified, a small amount of new material | |
| dc.identifier | https://arxiv.org/abs/math/0702567 | |
| dc.identifier | http://arxiv.org/abs/math/0702567 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/137564 | |
| dc.subject | Combinatorics | |
| dc.subject | 05B35; 68Q17 | |
| dc.title | Matroid complexity and non-succinct descriptions | |
| dc.type | text |