Research Briefs
LatestTrendingResearch digestsWorks
Log inSign up
AI & ComputingHealth & MedicineBiologyClimate & EnvironmentPhysics & SpaceMaterials & EnergyEngineering & TechnologySociety & Economics
AI & Computingpreprint2026-10-02

A RIGOROUS DISCRETE-CONTINUUM PROOF FRAMEWORK FOR P = NP

Open access0 citations

Abstract

This is my idea about the P vs NP problem, but the same analogy, but applied to computer sciences.

// Source

View paper (DOI)Open access versionOpenAlexZenodo (CERN European Organization for Nuclear Research)Published 2026-10-02

Authors: Herman Jahzeel Martinez Suazo

Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchCryptography and Residue Arithmetic

Research Briefs

Latest research summaries, based on open scholarly metadata and available source materials. Medical summaries are for informational purposes only and are not medical advice.

AI & ComputingHealth & MedicineBiologyClimate & EnvironmentPhysics & SpaceMaterials & EnergyEngineering & TechnologySociety & Economics

© 2026 Research Briefs.

Privacy policy