Geometric Alignment in Computational Hardness: A Deterministic Alternative to Search Complexity in Number Theoretic Problems

OSF Preprints (OSF Preprints) 2026 Preprint Open access

Read full text
Authors: Ender UYGUN
DOI: 10.5281/zenodo.18648599
Cited by: 0

Fields of Study & Subjects

Analytic Number Theory Research Complexity and Algorithms in Graphs Cryptography and Data Security

Publication details

Journal / source
OSF Preprints (OSF Preprints)
Publication date
15 February 2026
Language
EN
Document type
Preprint