Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2025
|
| Online Access: | https://doi.org/10.5281/zenodo.15320472 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <p>This paper proposes a restricted computational analog of the Hodge Conjecture, derived from the proven entropy-based separation of P and NP.<br>The result shows that any persistent cohomology class emerging from bounded-treewidth graphs associated with NP-complete inputs must correspond to algebraically realizable (constructive) structure.<br>Otherwise, it would violate the entropic barrier that limits the recoverability of semantic content from persistent topological data.<br>The work bridges concepts in computational complexity, algebraic topology, and information theory.</p>