P = NP – a proposed solution

A possible solution to the impossible problem of P=NP. With practical examples of applying the method to solve other impossible problems.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2024-11-07
DOI
https://doi.org/10.5281/zenodo.14049002
Primary Topic
Genome Rearrangement Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

P = NP – a proposed solution

Zenodo (CERN European Organization for Nuclear Research)
Genome Rearrangement Algorithms
article

P = NP – a proposed solution

article en

Abstract

A possible solution to the impossible problem of P=NP. With practical examples of applying the method to solve other impossible problems.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 40%
Genome Rearrangement Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

P = NP – a proposed solution · Zenodo (CERN European Organization for Nuclear Research) (2024) | TGRS Research Map | TGRS