First-order queries on structures of bounded degree are computable with constant delay.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tocl/DurandG07
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tocl/DurandG07
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Arnaud_Durand_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Etienne_Grandjean
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1276920.1276923
>
foaf:
homepage
<
https://doi.org/10.1145/1276920.1276923
>
dc:
identifier
DBLP journals/tocl/DurandG07
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1276920.1276923
(xsd:string)
dcterms:
issued
2007
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tocl
>
rdfs:
label
First-order queries on structures of bounded degree are computable with constant delay.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Arnaud_Durand_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Etienne_Grandjean
>
swrc:
number
4
(xsd:string)
swrc:
pages
21
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tocl/DurandG07/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tocl/DurandG07
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tocl/tocl8.html#DurandG07
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1276920.1276923
>
dc:
subject
Computational complexity, enumeration problems, first-order logic
(xsd:string)
dc:
title
First-order queries on structures of bounded degree are computable with constant delay.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
8
(xsd:string)