APA (7th ed.) Citation

Campbell, R., Guillon, B., Kante, M. M., Kim, E. J., & Oum, S. (2025, June 23). Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 678-690. https://doi.org/10.1109/LICS65433.2025.00057

Chicago Style (17th ed.) Citation

Campbell, Rutger, Bruno Guillon, Mamadou Moustapha Kante, Eun Jung Kim, and Sang-il Oum. "Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width." 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 23 Jun. 2025: 678-690. https://doi.org/10.1109/LICS65433.2025.00057.

MLA (9th ed.) Citation

Campbell, Rutger, et al. "Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width." 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 23 Jun. 2025, pp. 678-690, https://doi.org/10.1109/LICS65433.2025.00057.