Thumbnail
Access Restriction
Open

Author Hlineny, Petr ♦ Seese, Detlef
Source CiteSeerX
Content type Text
Publisher Springer Verlag
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Representable Matroids ♦ Mso Theory ♦ Class Of-representable Matroids ♦ Decidable Mso Theory ♦ Finite Field
Description We show that, for every finite field, the class of all representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we prove that every class of-representable matroids with a decidable MSO theory must have uniformly bounded branch-width.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2004-01-01
Publisher Institution PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON PARAMETERIZED AND EXACT COMPUTATION, IWPEC 2004