Enterprise AI governance encompasses the policies, procedures, and technical controls that ensure AI systems operate within regulatory, ethical, and organizational boundaries. Despite the proliferation of governance frameworks (NIST AI RMF, ISO/IEC 42001, EU AI Act), the computational foundations of these frameworks remain poorly understood. We ask a fundamental question: which governance problems are tractable, and which are intrinsically hard?

We formalize three core governance problems — compliance verification, behavioral monitoring, and audit log analysis — and characterize their complexity in terms of standard complexity classes. Our results have direct implications for the design of enterprise AI governance infrastructure.

Formal Problems

We define three decision problems that capture essential governance tasks:

NP-Hardness of Compliance Verification

Theorem 1. Compliance Verification for neural network models with ReLU activations and linear temporal logic (LTL) specifications is NP-complete, even for specifications restricted to the safety fragment of LTL.

Proof sketch. Reduction from 3-SAT. Construct a ReLU network with one hidden layer that simulates a clause evaluation circuit. The specification S encodes the satisfying assignment condition. The construction uses O(n) neurons for a 3-SAT instance with n variables. Hardness follows from the NP-completeness of 3-SAT; membership follows from the polynomial-time verifiability of a certificate (a satisfying assignment).

Implication: Exact compliance verification for neural networks with general specifications is intractable in the worst case. Enterprises must either restrict the specification language or accept approximate verification.

Tractability of Monitoring

Theorem 2. Behavioral Monitoring with properties expressed in the safety fragment of LTL is solvable in O(k · |P|) time, where k is the trace length and |P| is the size of the property specification. This is optimal up to logarithmic factors.

The key insight is that safety properties — those that can be violated in finite time — correspond to regular languages recognizable by DFAs whose size is linear in |P|. Monitoring reduces to DFA simulation across the trace. This tractability result explains the effectiveness of runtime monitoring approaches in production AI systems.

Complexity Landscape of Governance Problems