# Compression

## Geometric Path Enumeration for Equivalence Verification of Neural Networks

We present and evaluate an approach for proving equivalence properties on neural networks and show that the verification of $\epsilon$-equivalence is coNP-complete