Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
The Law of Computational Impossibility (P vs NP)
The Law of Computational Impossibility (P vs NP)
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Zain Al-Abedien, (Muhannad)
Format:
Recurso digital
Language:
En
Published:
Zenodo
2025
Subjects:
P vs NP
NP-Hard
TSP
NP Problem
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
Proving the Non-Equivalence of P and NP: A Logical Reductio ad Absurdum via Holographic Block-Height
by: li, shaoren
Published: (2026)
NP vs. coNP as an Observer Constraint: A Physics-Informed Framework
by: Fernandes, Ricardo Miguel Machado
Published: (2025)
Subfields as the Unit of Progress: A Modular Path Through P vs NP
by: Figurelli, Rogério
Published: (2026)
Abel's Revenge: The Death of P = NP
by: Eva, Moss
Published: (2026)
Topics in Theoretical Computer Science
by: Rode, Alexander Forrest
Published: (2025)