The complexity of acyclic conjunctive queries

DOI10.1109/SFCS.1998.743521MaRDI QIDQ6909446zbMATH OpenFDO

Authors Georg Gottlob, Francesco Scarcello, N. Leone

Publication date 29 October 2025

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

This page was built for publication: The complexity of acyclic conjunctive queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909446)