Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/693
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGemis, Marc-
dc.contributor.authorParedaens, Jan-
dc.contributor.authorPeelman, Peter-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2005-03-24T11:22:16Z-
dc.date.available2005-03-24T11:22:16Z-
dc.date.issued1998-
dc.identifier.citationTheory of Computing Systems, 31(3). p. 231-249-
dc.identifier.urihttp://hdl.handle.net/1942/693-
dc.description.abstractThe Generic Graph Machine (GGM) model is a Turing machine-like model for expressing generic computations working directly on graph structures. In this paper we present a number of observations concerning the expressiveness and complexity of GGMs. Our results comprise the following: (i) an intrinsic characterization of the pairs of graphs that are an input–output pair of some GGM; (ii) a comparison betweenGGMcomplexity and TM complexity; and (iii) a detailed discussion on the connections between the GGM model and other generic computation models considered in the literature, in particular the generic complexity classes of Abiteboul and Vianu, and the Database Method Schemes of Denninghoff and Vianu.-
dc.format.extent160336 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherSpringer-Verlag-
dc.titleExpressiveness and complexity of generic graph machines-
dc.typeJournal Contribution-
dc.identifier.epage249-
dc.identifier.issue3-
dc.identifier.spage231-
dc.identifier.volume31-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcat-
dc.identifier.doi10.1007/s002240000087-
item.fulltextWith Fulltext-
item.contributorGemis, Marc-
item.contributorParedaens, Jan-
item.contributorPeelman, Peter-
item.contributorVAN DEN BUSSCHE, Jan-
item.fullcitationGemis, Marc; Paredaens, Jan; Peelman, Peter & VAN DEN BUSSCHE, Jan (1998) Expressiveness and complexity of generic graph machines. In: Theory of Computing Systems, 31(3). p. 231-249.-
item.accessRightsClosed Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
expressiveness.pdf156.58 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.