Methods for algorithmic meta theorems

Martin Grohe, Stephan Kreutzer · Contemporary mathematics - American Mathematical Society · 2011

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.

Read the paper · More papers on PaperTik