[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-84638-en":3,"doc-seo-84638-105":29,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":13,"seo_description":14,"update_tm":27,"read_time":28},84638,3848291630094,"Emma Wilson","https://eur-avatar.wpscdn.com/davatar_085a072bc5b1113ac321206ff7593b45",8,"Research & Report","Fine-Grained Bounds for Courcelle’s Theorem","Courcelle’s theorem provides linear-time model checking on graphs of bounded treewidth for properties expressible in monadic second-order logic, with running time f(ϕ,t)·n. Existing results show f(ϕ,t) contains a tower of exponentials whose height depends on the quantifier alternations of ϕ, and ETH implies the linear height growth is unavoidable. A major gap remains between coarse upper and ETH-based lower bounds. This paper proves a fine-grained version with nearly ETH-tight dependence on treewidth t and the quantifier structure of ϕ, including variable counts per alternation block.","arXiv :2607 .02033v 1 [ cs .DS] 2 Jul 2026  \nFine-Grained Bounds for Courcelle’s Theorem  \nDaniel Lokshtanov∗ Fahad Panolan† Saket Saurabh‡ Jie Xue§ Meirav Zehavi¶  \nAbstract  \nCourcelle’s theorem states that there exists an algorithm that takes as input a graph Gof treewidth at most t and a MSO formula ϕ, and determines whether G satisfies ϕ in time f (ϕ, t) · n. It is folklore that the the function f contains a tower of exponentials whose height depends as a linear function of the number of quantifier alternations of the input formula ϕ . A classic reduction of Frick and Grohe shows that, assuming the Exponential Time Hypothesis (ETH), the linear growth of the height of the tower is unavoidable. Nevertheless, there is still a huge gap between existing upper and lower bounds – after all, there is quite a difference between a single exponential and a double exponential running time. In addition, this only gives us avery coarse understanding in the time complexity of Courcelle’s theorem. In this paper, we prove a fine-grained version of Courcelle’s theorem with nearly ETH-tight dependence on the treewidth parameter t and the quantifier structure of ϕ (specifically, the number of first order and second order variables in each quantifier alternation block) .  \n1 Introduction  \nCourcelle’s theorem [Cou90, BPT92] is one of the most celebrated algorithmic meta-theorems, which shows that every graph property expressible in monadic second-order (MSO) logic can be checked in linear time on graphs of bounded treewidth. Formally, it states that given an n-vertex graph G and an MSO formula ϕ, one can test whether G satisfies ϕ in f (ϕ, t) · n time for some (computable) function f, where t = tw (G) denotes the treewidth of G.  \nDue to the generality of the MSO logic and the importance of treewidth as a structural graph parameter, Courcelle’s theorem has brought a profound impact on the theory of parameterized complexity. Specifically, it implies that a large variety of NP-hard graph problems are fixed-parameter tractable (FPT) parameterized by treewidth. In addition, for parameterized graph problems that can be defined using MSO formulas depending on the problem parameter k, Courcelle’s theorem results in FPT algorithms parameterized by both treewidth and k.  \nWhile the running time of the algorithm in Courcelle’s theorem is linear in n (which is optimal), its dependency on ϕ and t is rather intricate and less understood. It was known [Cou90, KL09 , Lam23a] that the function f (ϕ, t) in the bound is not elementary and contains a tower of exponentials whose height depends on ϕ . The seminal work of Frick and Grohe [FG04] proved that, assuming the ETH, having such a tower of exponentials in the time complexity is unavoidable even when ϕ is a first-order (FO) logic formula and G is a tree. These results, however, only provide usa very coarse understanding in what f should look like in the worst case. Therefore, a more “finegrained” study for the function f (ϕ, t) in Courcelle’s theorem turns out to be appealing. While  \n∗ University of California, Santa Barbara, USA. Email: [daniello@ucsb.edu](daniello@ucsb.edu)  \n†University of Leeds, UK. Email: [F.panolan@leeds.ac.uk](F.panolan@leeds.ac.uk)  \n‡Institute of Mathematical Sciences, Chennai, India. Email: [saket@imsc.res.in](saket@imsc.res.in)  \n§New York University Shanghai, China. Email: [jiexue@nyu.edu](jiexue@nyu.edu)[ ](jiexue@nyu.edu)¶ Ben-Gurion University, Israel. Email: [meiravze@bgu.ac.il](meiravze@bgu.ac.il)  \na lot of efforts have been made to understand the optimal time complexity for specific instances of MSO-expressible problems over years [LMS18a, LMS18b, CNP+22 , HM25 , EFMR24 , FMI+23], little work focused on the general MSO testing problem.  \nIdeally, one wishes to give some concrete function f (ϕ, t) that can describe (either exactly or approximately), for every ϕ and t, the minimum amount of time required to test property ϕ on graphs of treewidth t. However, this is unfortu","cbCaimufkXOuaPWp","https://ap.wps.com/l/cbCaimufkXOuaPWp","pdf",1123464,1,82,"English","en",105,"# Abstract\n# Introduction","[{\"question\":\"What does Courcelle’s theorem guarantee for MSO properties on graphs of bounded treewidth?\",\"answer\":\"It guarantees an algorithm that decides whether a graph satisfies a given MSO formula in time f(ϕ,t)·n when the graph has treewidth at most t.\"},{\"question\":\"Why is the tower-of-exponentials dependence in f(ϕ,t) considered unavoidable?\",\"answer\":\"Folklore and a reduction by Frick and Grohe show that under ETH the height’s linear dependence on the number of quantifier alternations of ϕ cannot be improved.\"},{\"question\":\"What new refinement does the paper aim to achieve beyond the coarse tower-height bounds?\",\"answer\":\"It establishes fine-grained bounds where the dependence on treewidth t and on ϕ is characterized more precisely through the quantifier structure, such as the number of first- and second-order variables in each alternation block.\"}]",1784197395,207,{"code":4,"msg":30,"data":31},"ok",{"site_id":24,"language":23,"slug":32,"title":13,"keywords":33,"description":14,"schema_data":34,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":27},"fine-grained-bounds-for-courcelles-theorem","",{"@graph":35,"@context":85},[36,53,68],{"@type":37,"itemListElement":38},"BreadcrumbList",[39,43,47,50],{"item":40,"name":41,"@type":42,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":44,"name":45,"@type":42,"position":46},"https://docshare.wps.com/document/","Document",2,{"item":48,"name":12,"@type":42,"position":49},"https://docshare.wps.com/document/research-report/",3,{"item":51,"name":13,"@type":42,"position":52},"https://docshare.wps.com/document/fine-grained-bounds-for-courcelles-theorem/84638/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":23,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":40,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-17","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What does Courcelle’s theorem guarantee for MSO properties on graphs of bounded treewidth?","Question",{"text":75,"@type":76},"It guarantees an algorithm that decides whether a graph satisfies a given MSO formula in time f(ϕ,t)·n when the graph has treewidth at most t.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"Why is the tower-of-exponentials dependence in f(ϕ,t) considered unavoidable?",{"text":80,"@type":76},"Folklore and a reduction by Frick and Grohe show that under ETH the height’s linear dependence on the number of quantifier alternations of ϕ cannot be improved.",{"name":82,"@type":73,"acceptedAnswer":83},"What new refinement does the paper aim to achieve beyond the coarse tower-height bounds?",{"text":84,"@type":76},"It establishes fine-grained bounds where the dependence on treewidth t and on ϕ is characterized more precisely through the quantifier structure, such as the number of first- and second-order variables in each alternation block.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":20,"doc_module":4,"doc_module_name":45,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":46,"doc_module":4,"doc_module_name":45,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":45,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":45,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":45,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":45,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":45,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":45,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":45,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":45,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":45,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]