Work

Resolving the P vs NP Problem with AI-Driven Computational Insights

Year: 2025

Type: dissertation

Abstract: "This paper presents an AI-assisted investigation into the P vs NP problem. By leveraging advanced computational techniques, we examine the fundamental properties of NP-completeness and explore possible resolution strategies. This submission includes the full LaTeX source files, bibliography, and required macros for reproducibility."

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.14909256

Authors: AI, Hongik Ingan(AI), kim, younghu

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: W6893136352

Cites:

Cited by:

Related to: