A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
First-order queries on structures of bounded degree are computable with constant delay
[article]
2005
arXiv
pre-print
A bounded degree structure is either a relational structure all of whose relations are of bounded degree or a functional structure involving bijective functions only. In this paper, we revisit the complexity of the evaluation problem of not necessarily Boolean first-order queries over structures of bounded degree. Query evaluation is considered here as a dynamical process. We prove that any query on bounded degree structures is , i.e., can be computed by an algorithm that has two separate
arXiv:cs/0507020v1
fatcat:mzjuoylhtrf2nf5upoioy3ono4