×

Found 8 Documents (Results 1–8)

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
Full Text: DOI

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
Full Text: DOI arXiv

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
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software