{'fraction_non_alphanumeric': 0.01847290640394089, 'fraction_numerical': 0.0, 'mean_word_length': 5.4523809523809526, '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}}
An efficient approach to decomposition of multi-output Boolean functions with large sets of bound variables

Finding appropriate bound sets of variables is the most important task of functional decomposition. When solving some problems, the bound sets need to be larger, for instance in decomposition to symmetric subfunctions realized in MOPS arrays for submicron technologies, or when no good small bound sets exist. In such cases, the creation of the incompatibility graph, which is necessary to evaluate good variable partitionings, becomes very inefficient. Therefore, an algorithm is proposed that can speed up this process by orders of magnitude without sacrificing the quality of the decomposition, because the same graph coloring algorithms (exact or approximate) are still applied to the created graph.