{"title":"算法元定理的方法","authors":"Martin Grohe, S. Kreutzer","doi":"10.1090/conm/558/11051","DOIUrl":null,"url":null,"abstract":"Algorithmic meta-theorems state that certain families of algorithmic problems, usually defined in terms of logic, can be solved efficiently. This is a survey of algorithmic meta-theorems, highlighting the general methods available to prove such theorems rather than specific results.","PeriodicalId":110641,"journal":{"name":"AMS-ASL Joint Special Session","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"77","resultStr":"{\"title\":\"Methods for Algorithmic Meta Theorems\",\"authors\":\"Martin Grohe, S. Kreutzer\",\"doi\":\"10.1090/conm/558/11051\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algorithmic meta-theorems state that certain families of algorithmic problems, usually defined in terms of logic, can be solved efficiently. This is a survey of algorithmic meta-theorems, highlighting the general methods available to prove such theorems rather than specific results.\",\"PeriodicalId\":110641,\"journal\":{\"name\":\"AMS-ASL Joint Special Session\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"77\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AMS-ASL Joint Special Session\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/conm/558/11051\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AMS-ASL Joint Special Session","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/conm/558/11051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algorithmic meta-theorems state that certain families of algorithmic problems, usually defined in terms of logic, can be solved efficiently. This is a survey of algorithmic meta-theorems, highlighting the general methods available to prove such theorems rather than specific results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
