On the Polynomial Resolution of NP-Complete Structures.

Figshare 2026 Preprint Open access

Read full text
Authors: Alessandro Monti
DOI: 10.6084/m9.figshare.31162207
Cited by: 0

Abstract

This research presents a formal framework for the resolution of NP-Complete problems in polynomial time. By introducing a novel "Void-Filtering" operator (S), we demonstrate that the exponential complexity traditionally associated with these structures is not an intrinsic property, but rather an artifact of informational noise.

Fields of Study & Subjects

Complexity and Algorithms in Graphs Advanced Graph Theory Research Computability Logic AI Algorithms

Publication details

Journal / source
Figshare
Publication date
1 January 2026
Document type
Preprint