Space and circuit complexity of monadic second-order definable problemes on tree-decomposable structures

dc.affiliation.institute	Institut für Theoretische Informatik	de
dc.contributor.author	Elberfeld, Michael
dc.contributor.referee	Tantau, Till
dc.contributor.referee	Vollmer, Heribert
dc.date.accepted	2012
dc.date.accessioned	2023-08-01T06:46:43Z
dc.date.available	2023-08-01T06:46:43Z
dc.date.issued	2013
dc.identifier.dnbppn	1033201855
dc.identifier.gbvppn	745073565
dc.identifier.uri	https://epub.uni-luebeck.de/handle/zhb_hl/1191
dc.identifier.urn	urn:nbn:de:gbv:841-2013030615
dc.language	eng
dc.language.iso	en
dc.language.rfc3066	en-US
dc.publisher.department	Sektion Informatik / Technik	de
dc.publisher.place	Lübeck	de
dc.subject.ddc	510
dc.subject.ddc	004
dc.title	Space and circuit complexity of monadic second-order definable problemes on tree-decomposable structures	en
dc.type	thesis.doctoral

Dateien

Gerade angezeigt 1 - 1 von 1