Characterizing NC1 with Typed Monoids

2025-08-14

AI Summary

This paper resolves an open problem posed by Lautemann et al. concerning the expressive power of quantifiers in NC¹, providing the first algebraic characterization of NC¹ via typed monoids—surpassing the TC⁰ characterization framework of Krebs et al. (2007). Methodologically, it extends first-order logic with unary quantifiers and finite monoid multiplication quantifiers, and leverages Bojańczyk et al.’s string-interpretation reduction technique to collapse higher-dimensional monoid quantifiers into unary ones. The main contributions are: (i) establishing language equivalence between NC¹ and this extended logic; (ii) proving that, under string interpretations, higher-dimensional multiplication quantifiers are fully expressible using only unary quantifiers; and (iii) pioneering the successful extension of algebraic automata theory to the NC¹ level, thereby introducing a novel algebraic characterization paradigm for complexity classes beyond TC⁰.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Reasoning under Uncertainty: Uncertainty Representations

Application Category

• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

Krebs et al. (2007) gave a characterization of the complexity class TC0 as the class of languages recognized by a certain class of typed monoids. The notion of typed monoid was introduced to extend methods of algebraic automata theory to infinite monoids and hence characterize classes beyond the regular languages. We advance this line of work beyond TC0 by giving a characterization of NC1. This is obtained by first showing that NC1 can be defined as the languages expressible in an extension of first-order logic using only unary quantifiers over regular languages. The expressibility result is a consequence of a general result showing that finite monoid multiplication quantifiers of higher dimension can be replaced with unary quantifiers in the context of interpretations over strings, which also answers a question of Lautemann et al. (2001). We establish this collapse result for a much more general class of interpretations using results on interpretations due to Bojańczyk et al. (2019), which may be of independent interest.

Problem

• Characterizing NC1 complexity class using typed monoids
• Extending algebraic automata theory beyond regular languages
• Replacing higher-dimensional quantifiers with unary quantifiers

Innovation

• Characterizing NC1 via typed monoids
• Using unary quantifiers over regular languages
• Collapsing higher-dimensional to unary quantifiers