Work

P vs NP

Year: 2025

Type: article

Abstract: This article was published hastily, without proper review of the translation and typography, and serves only as a preliminary record. It is recommended to refer to the most recent version, which has been thoroughly revised, refined, and submitted to journals and conference proceedings.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.16320940

Author: O'Haiffer, Alexandre

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

FWCI:

Cites:

Cited by:

Related to: