Lower Bounds on the Complexity of MSO1 Model-Checking

Robert Ganian, Petr Hlinen{\'{y}}, Alexander Langer, Jan Obdrz{\'{a}}lek, Peter Rossmanith, Somnath Sikdar
January 2012
bib

Abstract

Full Citation:

Robert Ganian, Petr Hlinen'y, Alexander Langer, Jan Obdrz'alek, Peter Rossmanith, Somnath Sikdar. Lower Bounds on the Complexity of MSO1 Model-Checking. 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326-337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Type
Conference Paper
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.