Soup Sieve: Polynomial-time denial of service in the descendant combinator

Summary Matching a selector that uses the descendant combinator a b takes time that grows polynomially with how deeply the document is nested, and each extra descendant combinator in the selector raises the degree by one. A selector with k descendant combinators takes On^k+1 time on a chain of n...