Work

A Novel Logical Resolution to the P vs NP Problem

Year: 2025

Type: article

Abstract: This paper introduces a new logical structure to resolve the P vs NP problem. By analyzing the foundational mechanics of polynomial vs non-deterministic polynomial-time problem-solving, we demonstrate that P ≠ NP through a series of bounded logical transformations. This approach avoids abstract reduction and instead focuses on stepwise logical constraints.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.15203129

Author: Owies, Samer

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6911969606

FWCI:

Cites:

Cited by:

Related to: