Grohe, Martin; Neuen, Daniel Canonisation and definability for graphs of bounded rank width. (English) Zbl 07650602 ACM Trans. Comput. Log. 24, No. 1, Paper No. 6, 31 p. (2023). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{M. Grohe} and \textit{D. Neuen}, ACM Trans. Comput. Log. 24, No. 1, Paper No. 6, 31 p. (2023; Zbl 07650602) Full Text: DOI arXiv
Grädel, Erich; Grohe, Martin; Pago, Benedikt; Pakusa, Wied A finite-model-theoretic view on propositional proof complexity. (English) Zbl 1451.03023 Log. Methods Comput. Sci. 15, No. 1, Paper No. 4, 53 p. (2019). MSC: 03C13 03F20 68Q19 PDFBibTeX XMLCite \textit{E. Grädel} et al., Log. Methods Comput. Sci. 15, No. 1, Paper No. 4, 53 p. (2019; Zbl 1451.03023) Full Text: arXiv
Berkholz, Christoph; Bonsma, Paul; Grohe, Martin Tight lower and upper bounds for the complexity of canonical colour refinement. (English) Zbl 1368.68219 Theory Comput. Syst. 60, No. 4, 581-614 (2017). MSC: 68Q25 05C15 05C60 05C85 PDFBibTeX XMLCite \textit{C. Berkholz} et al., Theory Comput. Syst. 60, No. 4, 581--614 (2017; Zbl 1368.68219) Full Text: DOI arXiv
Grädel, Erich; Grohe, Martin Is polynomial time choiceless? (English) Zbl 1465.68100 Beklemishev, Lev D. (ed.) et al., Fields of logic and computation II. Essays dedicated to Yuri Gurevich on the occasion of his 75th birthday. Cham: Springer. Lect. Notes Comput. Sci. 9300, 193-209 (2015). MSC: 68Q19 03C13 PDFBibTeX XMLCite \textit{E. Grädel} and \textit{M. Grohe}, Lect. Notes Comput. Sci. 9300, 193--209 (2015; Zbl 1465.68100) Full Text: DOI
Abu Zaid, F.; Grädel, E.; Grohe, M.; Pakusa, W. Choiceless polynomial time on structures with small abelian colour classes. (English) Zbl 1426.68106 Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part I. Berlin: Springer. Lect. Notes Comput. Sci. 8634, 50-62 (2014). MSC: 68Q19 03C13 68Q15 PDFBibTeX XMLCite \textit{F. Abu Zaid} et al., Lect. Notes Comput. Sci. 8634, 50--62 (2014; Zbl 1426.68106) Full Text: DOI
Grohe, Martin Fixed-point definability and polynomial time on chordal graphs and line graphs. (English) Zbl 1287.68064 Blass, Andreas (ed.) et al., Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). Lecture Notes in Computer Science 6300, 328-353 (2010). MSC: 68Q19 03C13 68Q15 PDFBibTeX XMLCite \textit{M. Grohe}, Lect. Notes Comput. Sci. 6300, 328--353 (2010; Zbl 1287.68064) Full Text: DOI arXiv
Grohe, Martin Fixed-point definability and polynomial time. (English) Zbl 1257.68069 Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 20-23 (2009). MSC: 68Q15 03B70 68Q19 PDFBibTeX XMLCite \textit{M. Grohe}, Lect. Notes Comput. Sci. 5771, 20--23 (2009; Zbl 1257.68069) Full Text: DOI
Grohe, Martin Finite variable logics in descriptive complexity theory. (English) Zbl 0940.03040 Bull. Symb. Log. 4, No. 4, 345-398 (1998). Reviewer: J.Flum (Freiburg i.Br.) MSC: 03C13 68Q19 03D15 03D70 68Q15 PDFBibTeX XMLCite \textit{M. Grohe}, Bull. Symb. Log. 4, No. 4, 345--398 (1998; Zbl 0940.03040) Full Text: DOI Link Link