Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
100
Voted
IWPEC
2004
Springer
95
views
Applied Computing
»
more
IWPEC 2004
»
On Decidability of MSO Theories of Representable Matroids
15 years 8 months ago
Download
www.fi.muni.cz
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 p...
Petr Hlinený, Detlef Seese
claim paper
Read More »