{'fraction_non_alphanumeric': 0.026615969581749048, 'fraction_numerical': 0.0076045627376425855, 'mean_word_length': 5.506172839506172, '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}}
Complexity of decision‐theoretic troubleshooting

The goal of troubleshooting is to find an optimal solution strategy consisting of actions and observations for repairing a device. We assume a probabilistic model of dependence between possible faults, actions, and observations; the goal is to minimize the expected cost of repair (ECR). We show that the task of finding an optimal solution strategy is NP hard for various troubleshooting models; therefore, approximate algorithms are necessary. © 2003 Wiley Periodicals, Inc.