| dc.contributor.author | Hliněný, Petr | |
| dc.date.accessioned | 2006-10-16T10:58:58Z | |
| dc.date.available | 2006-10-16T10:58:58Z | |
| dc.date.issued | 2006 | |
| dc.identifier.citation | Mathematical foundations of computer science 2006 : 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006. Proceedings. 2006, p. 505-516. | en |
| dc.identifier.isbn | 978-3-540-37791-7 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10084/57135 | |
| dc.description.abstract | In this paper we look at complexity aspects of the following problem (matroid representability) which seems to play an important role in structural matroid theory: Given a rational matrix representing the matroid M, the question is whether M can be represented also over another specific finite field. We prove this problem is hard, and so is the related problem of minor testing in rational matroids. The results hold even if we restrict to matroids of branch-width three. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Mathematical foundations of computer science 2006 : 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/11821069_44 | en |
| dc.subject | matroid representability | en |
| dc.subject | minor | en |
| dc.subject | finite field | en |
| dc.subject | spike | en |
| dc.subject | swirl | en |
| dc.title | On matroid representability and minor problems | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/11821069_44 | |
| dc.identifier.wos | 000240271700044 | |