This HTML5 document contains 53 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n18http://purl.org/net/nknouf/ns/bibtex#
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n23https://schema.org/
shttp://schema.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n13http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F12%3A00057595%21RIV13-GA0-14330___/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n24http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F12%3A00057595%21RIV13-GA0-14330___
rdf:type
n16:Vysledek skos:Concept
rdfs:seeAlso
http://stacs2012.lip6.fr/
dcterms:description
One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quantifications (MSO2) is decidable in linear time on any class of graphs of bounded tree-width. In the parlance of parameterized complexity, this means that MSO2 model-checking is fixed-parameter tractable with respect to the tree-width as parameter. Recently, Kreutzer and Tazari proved a corresponding complexity lower-bound---that MSO2 model-checking is not even in XP wrt the formula size as parameter for graph classes that are subgraph-closed and whose tree-width is poly-logarithmically unbounded. Of course, this is not an unconditional result but holds modulo a certain complexity-theoretic assumption, namely, the Exponential Time Hypothesis (ETH). In this paper we present a closely related result. One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quantifications (MSO2) is decidable in linear time on any class of graphs of bounded tree-width. In the parlance of parameterized complexity, this means that MSO2 model-checking is fixed-parameter tractable with respect to the tree-width as parameter. Recently, Kreutzer and Tazari proved a corresponding complexity lower-bound---that MSO2 model-checking is not even in XP wrt the formula size as parameter for graph classes that are subgraph-closed and whose tree-width is poly-logarithmically unbounded. Of course, this is not an unconditional result but holds modulo a certain complexity-theoretic assumption, namely, the Exponential Time Hypothesis (ETH). In this paper we present a closely related result.
dcterms:title
Lower Bounds on the Complexity of MSO_1 Model-Checking Lower Bounds on the Complexity of MSO_1 Model-Checking
skos:prefLabel
Lower Bounds on the Complexity of MSO_1 Model-Checking Lower Bounds on the Complexity of MSO_1 Model-Checking
skos:notation
RIV/00216224:14330/12:00057595!RIV13-GA0-14330___
n16:predkladatel
n17:orjk%3A14330
n3:aktivita
n24:S n24:P
n3:aktivity
P(GAP202/11/0196), S
n3:dodaniDat
n6:2013
n3:domaciTvurceVysledku
n5:3294099 n5:6376290 n5:7595646
n3:druhVysledku
n22:D
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
147519
n3:idVysledku
RIV/00216224:14330/12:00057595
n3:jazykVysledku
n20:eng
n3:klicovaSlova
Monadic Second-Order Logic; Treewidth; Lower Bounds; Exponential Time Hypothesis; Parameterized Complexity
n3:klicoveSlovo
n7:Exponential%20Time%20Hypothesis n7:Lower%20Bounds n7:Monadic%20Second-Order%20Logic n7:Treewidth n7:Parameterized%20Complexity
n3:kontrolniKodProRIV
[800792753F08]
n3:mistoKonaniAkce
Paris
n3:mistoVydani
Dagstuhl, Germany
n3:nazevZdroje
29th International Symposium on Theoretical Aspects of Computer Science STACS2012
n3:obor
n4:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
6
n3:projekt
n19:GAP202%2F11%2F0196
n3:rokUplatneniVysledku
n6:2012
n3:tvurceVysledku
Sikdar, Somnath Rossmanith, Peter Langer, Alexander Hliněný, Petr Obdržálek, Jan Ganian, Robert
n3:typAkce
n12:WRD
n3:zahajeniAkce
2012-01-01+01:00
s:issn
1868-8969
s:numberOfPages
12
n13:doi
10.4230/LIPIcs.STACS.2012.326
n18:hasPublisher
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS
n23:isbn
9783939897354
n21:organizacniJednotka
14330