Paper: Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width (at LICS 2025)

Authors: Rutger Campbell Bruno Guillon Mamadou Moustapha Kanté Eun Jung Kim Sang-il Oum

Abstract

No Abstract Available

BibTeX

  @InProceedings{CampbellGuillonKant-RecognisabilityEqua,
    author = 	 {Rutger Campbell and Bruno Guillon and Mamadou Moustapha Kanté and Eun Jung Kim and Sang-il Oum},
    title = 	 {Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width},
    booktitle =  {Proceedings of the Fortieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2025)},
    year =	 {2025},
    month =	 {June}, 
    pages =      {678--690},
    location =   {Singapore}, 
    publisher =	 {ACM}
  }