On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees

DOI10.1016/J.IPL.2010.06.001zbMath1234.68125OpenAlexW2024034679MaRDI QIDQ407530

Shun'ichi Amano

Publication date: 27 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.06.001

zbMATH Keywords

incomplete informationdatabasescertain answers

Mathematics Subject Classification ID

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

Cites Work

• On the representation and querying of sets of possible worlds
• Complexity of Data Tree Patterns over XML Documents
• Incomplete Information in Relational Databases

This page was built for publication: On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees