{'fraction_non_alphanumeric': 0.019855595667870037, 'fraction_numerical': 0.0, 'mean_word_length': 6.302631578947368, '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}}
High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)

This paper presents a new algorithm for the minimization of Boolean functions: the Partitioned Incremental Splitting of Intervals (PISI). This algorithm permits a high performance distributed implementation with a high speedup with relation to the original ISI algorithm, and an acceptable increase in the Boolean function representation complexity. Experimental results illustrate the main characteristics of the technique proposed.