{'fraction_non_alphanumeric': 0.012285012285012284, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On Lower Bounds for Algebraic Decision Trees over the Complex Numbers

We prove a new lower bound for the decision complexity of a complex algebraic set in terms of the sum of its (compactly supported) Bettinumbers, which is for the first time better than logarithmic. We apply this result to subspace arrangements including some well studied problems such as the knapsack and element distinctness problems.