Technology
Apple Research Proves Inverted Index Boolean Evaluation Is P-Complete, Introduces ComputePN Algorithm
Apple researchers proved that evaluating complex Boolean queries over inverted indexes is P-Complete, establishing a theoretical limit for traditional search engines. The ComputePN algorithm avoids exponential blowup and universal scans by using a Positive-Negative dual representation and DAG memoization.
