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
Topics in Theoretical Computer Science
Topics in Theoretical Computer Science
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Rode, Alexander Forrest
Format:
Recurso digital
Language:
English
Published:
Zenodo
2025
Subjects:
P vs NP, Complexity Theory, Time Hierarchy, Circuit Complexity, Simulation Depth, NP-complete Problems, Computational Complexity
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
Internet
https://doi.org/10.5281/zenodo.15291571
Similar Items
Proving the Non-Equivalence of P and NP: A Logical Reductio ad Absurdum via Holographic Block-Height
by: li, shaoren
Published: (2026)
Spectral Expanders, Non-Commutative Diffusion Laplacians, and the Structural Separation of Polynomial-Time Complexity Classes
by: Garrido, Daphne
Published: (2026)
Subfields as the Unit of Progress: A Modular Path Through P vs NP
by: Figurelli, Rogério
Published: (2026)
The Law of Computational Impossibility (P vs NP)
by: Zain Al-Abedien, (Muhannad)
Published: (2025)
A Formal Proof That P ≠ NP via SAT Space Irreducibility
by: Jorge, G. Pardo
Published: (2025)