Apple Paper Says Complex Boolean Search Queries Are P-Complete
Apple researchers present a formal complexity result for evaluating Boolean query DAGs over inverted indexes and propose ComputePN, an algorithm designed to avoid exponential query expansion and universe-scale scans.