Local Modifications of Nearest-Neighbor and Min-Plus Representations
cs.CC, cs.DM
Submitted: 2026-11-10
Updated: 2026-11-10
Comments: 19 pages, 2 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Nearest Neighbor Representations of Neurons
- A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?