Algorithmic Relativity Between NP and P
Abstract
This paper presents a solution to the $P$ vs $NP$ problem by showing how a problem's difficulty (NP vs P) is not fix but rather relative to the solver's access to operation/s required to get to a solution.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Advanced Graph Theory Research
Computability
Logic
AI Algorithms
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 8 February 2026
- Document type
- Preprint