{'fraction_non_alphanumeric': 0.042105263157894736, 'fraction_numerical': 0.01804511278195489, 'mean_word_length': 4.370967741935484, '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 a Modification of Lupanov's Method with More Uniform Distribution of Fan-out

In this paper we suggest a modification of classical Lupanov’s method [8] that allows building circuits over the basis {&,∨,¬} for Boolean functions of n variables with size at most 2n n ( 1 + 3 log n+O(1) n ) , and with more uniform distribution of outgoing arcs by circuit gates. For almost all Boolean functions of n variables in the circuits for these functions, which are built using our method, the fraction of gates with fanout 2 is asymptotically at least 1/32. This fact disproves upper bound [15] on the number of circuits with exact number of gates with fan-out at least 2.