Apple Paper Says Complex Boolean Search Queries Are P-Complete
Apple Machine Learning Research published a paper by Amir Aavani proving that evaluating deeply nested, non-monotonic Boolean queries over inverted indexes is strictly P-Complete, and introduced ComputePN, a deterministi…