First-order queries on structures of bounded degree are computable with constant delay
Résumé
This paper proves that any fixed first-order query over any structure of bounded degree can be computed with a constant delay between the tuples of the solution after a precomputation of linear time in the size of the structure S.
Domaines
Complexité [cs.CC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...