Some hard problems on matroid spikes
From MaRDI portal
Publication:2464317
DOI10.1007/s00224-007-1307-5zbMath1126.05030OpenAlexW2090724049MaRDI QIDQ2464317
Publication date: 19 December 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-1307-5
Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On the complexity of matroid isomorphism problem ⋮ Some open problems on excluding a uniform matroid ⋮ On the Complexity of Matroid Isomorphism Problems
This page was built for publication: Some hard problems on matroid spikes
