Computational Complexity of Probabilistic Reasoning for Neurosymbolic Classification Techniques

The asymptotic complexity of probabilistic reasoning is crucial to assess the scalability of probabilistic neurosymbolic techniques for large-scale classification tasks, but this topic is rarely tackled in the neurosymbolic literature.