Testing containment of object-oriented conjunctive queries is ∏2p-hard

DOI10.1007/bfb0030822zbMath1527.68052OpenAlexW1506025608MaRDI QIDQ6064017

Ron van der Meyden, Edward P. F. Chan

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030822

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Complete sets and the polynomial-time hierarchy

This page was built for publication: Testing containment of object-oriented conjunctive queries is ∏2p-hard