A new paper proves that evaluating Boolean query DAGs over inverted indexes is P-complete. It shows Document-at-a-Time iterators face exponential worst-case blowups when unrolling re-convergent query logic, while recursive materialization models may offer an alternative. The results give AI developers building search-backed neuro-symbolic agents a clearer picture
Opening Kapyn…