The Kaoru Discrete Reduction: A Resolution of P vs NP
Abstract
I present the Kaoru Discrete Reduction, a novel framework demonstrating that any NP-complete algorithm admits a polynomial-time equivalent through oracle-guided reduction. I introduce the concept of viability reduction and prove that the existence of finite algorithmic representations necessarily implies polynomial reducibility to viable forms. This establishes P = NP.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Advanced Graph Theory Research
Computability
Logic
AI Algorithms
Publication details
- Journal / source
- OSF Preprints (OSF Preprints)
- Publication date
- 1 January 2026
- Document type
- Preprint