7 citations · 16 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 2 cited
Tree automata and pigeonhole classes of matroids: II
Daryl Funk, Dillon Mayhew, Mike Newman
Let be a sentence in the counting monadic second-order logic of matroids and let be a finite field. Hliněný's Theorem says that we can test whether -re…
math.CO2019★ 2 cited
Tree automata and pigeonhole classes of matroids: I
Daryl Funk, Dillon Mayhew, Mike Newman
Hlineny's Theorem shows that any sentence in the monadic second-order logic of matroids can be tested in polynomial time, when the input is limited to a class of F-representable ma…