arXiv (OAI Expanded)open access
The $\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs
information retrieval, artificial intelligence, computational complexity, computation and language, databases
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 623223
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.