Matroid Complexity and Nonsuccinct Descriptions

DOI10.1137/050640576zbMath1167.05304arXivmath/0702567OpenAlexW2080976355MaRDI QIDQ3629456

Dillon Mayhew

Publication date: 27 May 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0702567

zbMATH Keywords

isomorphismmatroid minorsmatroid complexity

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

On the complexity of matroid isomorphism problem ⋮ Weak orientability of matroids and polynomial equations ⋮ Unnamed Item ⋮ On the Complexity of Matroid Isomorphism Problems

This page was built for publication: Matroid Complexity and Nonsuccinct Descriptions