computational-complexity

Experimental Subset Sum solver for large integers using SQLite as an out-of-core storage engine.

Certified frame-first SAT middleware — decide structured regions (2-SAT · GF(2) parity · counting) before CDCL, and independently verify every verdict (model replay · DRAT). A research harness for where SAT hardness lives.

P != NP

Pattern-Aware Complexity Framework (PACF) - A Python implementation for analyzing and exploiting structural patterns in NP-hard optimization problems, with a focus on the Traveling Salesman Problem (TSP). Supports extensible domains like genetic sequences and weather forecasting. Licensed under MIT

Python project for analyzing simplex method complexity on LPs in canonical form. Tracks FLOPs, generates problems, fits models, visualizes with Matplotlib, and caches results. Builds on work by Pavlov, Kyselov, et al. Uses Nelder-Mead optimization and MSE loss to fit empirical data to theoretical models like Borgwardt, Smoothed, and Polynomial.

Novel mathematical framework connecting P vs NP to the golden ratio phi via witness space geometry. Part of the unified E8/H4/phi theory.

GitHub profile README and URF start-here map

Repositorio de tareas y prácticas de la asignatura Complejidad Computacional Facultad de Ciencias UNAM semestre 2023-1

Exact brute-force and trimmed-list FPTAS implementations for the Subset Sum optimization problem in Python.

Trusted base of definitions, schemas, and verification artifacts for the Unified Rigidity Framework

Fully vectorized Transformer decoder implemented from scratch in NumPy with causal masking, autoregressive training, and empirical O(n²) complexity analysis.

Anonymous unrefereed candidate on exact value certificates and common-Hessian ordering hardness for random reshuffling

The interaction phase decides computational hardness in a conserved-charge quantum fluid

Proof-carrying Smithian Fold derivation and executable laboratory for classical and quantum computational sciences

Flagship executable URF/Chronos implementation with verified build and test surface

Python project on graph theory and computational complexity, solving SAT formulas and graph 3-coloring problems using brute-force search, CNF encoding, SAT solvers, and polynomial reduction