{'fraction_non_alphanumeric': 0.032214765100671144, 'fraction_numerical': 0.004026845637583893, 'mean_word_length': 4.874015748031496, '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}}
Escaping Local Minima in Logic Synthesis

In this paper, we continue studying Logic Synthesis Preserving Specification (LSPS). Given a combinational circuit N and its partition into subcircuits N1,.., Nk (this partition is called a specification of N), LSPS optimizes N by replacing each subcircuit Ni with toggle equivalent subcircuit Ni. As we showed before, LSPS is scalable. In this paper, we demonstrate that LSPS can be also viewed as an elegant way to address the local minimum entrapment problem. The latter remains a thorny issue for the heuristic algorithms for solving hard combinatorial problems. In this paper, we give only theoretical arguments in favor of LSPS. The preliminary experimental results of LSPS can be found in [6][7].