The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable

Matthieu Rosenfeld. The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 776-795, SIAM, 2021. [doi]

Authors

Matthieu Rosenfeld

This author has not been identified. Look up 'Matthieu Rosenfeld' in Google