Preprint
Article

This version is not peer-reviewed.

Wire Lower Bounds for Gates of Fan-In N1−δ

  ‡ (GitHub-related contact, https://github.com/creelie)

Submitted:

18 November 2026

Posted:

19 November 2026

You are already at the latest version

Abstract
A language in \(\mathrm{ENP}\) needs \(c(\delta)N\sqrt{\log N}\) wires in circuits, unambiguous circuits and integer tensor networks over gates of fan-in \(N^{1-\delta}\), and a language in \(\mathsf{S_2E}\) needs \(2^{N-N^{1-\delta}}/16\); the P versus NP problem remains open.
Keywords: 
;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.