Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations

2025-06-29

AI Summary

This paper investigates algebraic characterizations and complexity bounds for small Boolean circuit classes—specifically FAC⁰, FAC¹, FACC[2], and FNC¹. We introduce a unified framework based on discrete ordinary differential equations (ODEs), establishing the first exact correspondence between circuit computational power and linear-length ODE constraints: function linearity, bounded derivatives, and controlled growth rates. Our method yields ODE-completeness characterizations for FACC[2] (circuits with Mod₂ gates) and FNC¹ (log-depth circuits), delivering tight algebraic representations for multiple circuit classes. Crucially, we uncover the structural role of counting mechanisms in circuit computation, revealing how modular counting underpins separations among low-level complexity classes. These results provide novel analytical tools and potential pathways toward resolving longstanding open problems, such as the separation of FAC⁰ from FAC¹.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Machine Learning: Probabilistic Circuits and Graphical Models

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• 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

Abstract

In this paper, we provide a uniform framework for investigating small circuit classes and bounds through the lens of ordinary differential equations (ODEs). Following an approach recently introduced to capture the class of polynomial-time computable functions via ODE-based recursion schemas and later applied to the context of functions computed by unbounded fan-in circuits of constant depth (FAC^0), we study multiple relevant small circuit classes. In particular, we show that natural restrictions on linearity and derivation along functions with specific growth rate correspond to kinds of functions that can be proved to be in various classes, ranging from FAC^0 to FAC^1. This reveals an intriguing link between constraints over linear-length ODEs and circuit computation, providing new tools to tackle the complex challenge of establishing bounds for classes in the circuit hierarchies and possibly enhancing our understanding of the role of counters in this setting. Additionally, we establish several completeness results, in particular obtaining the first ODE-based characterizations for the classes of functions computable in constant depth with unbounded fan-in and Mod 2 gates (FACC[2]) and in logarithmic depth with bounded fan-in Boolean gates (FNC1).

Problem

• Characterizing small circuit classes via ODEs
• Linking ODE constraints to circuit computation
• Establishing ODE-based completeness for FACC[2] and FNC1

Innovation

• ODE-based recursion schemas for circuit classes
• Linearity and derivation restrictions for FAC^0-FAC^1
• ODE characterizations for FACC[2] and FNC1