Lectures for the "Problem Solving" Class at Nanjing University.

A Rust library for computational hard problem definitions and reductions

Efficient zero-knowledge arguments in the discrete log setting, revisited

This repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.

A C++ program that efficiently calculates the average values of nodes at each level in a binary tree, employing a level-order traversal approach for accurate and fast computation.

CA and Problem Sheets assigned to expedite the learning of the Theory of Computation, formally named the Theory of Algorithms. Fourth Year, Theory of Algorithms, Software Development.

Push_swap is a project about sorting data on a stack, with a limited set of instructions, using the lowest possible number of actions. Its goal is reaching an optimized data sorting solution.

A program that sorts a stack of numbers using a minimal set of operations

A public copy of the trend-prof empirical computational complexity measurement tool

This library is developed to perform efficient and exact computation of Dempster's and Fagin-Halpern conditionals (DS-Conditional-One and DS-Conditional-All in C++)

Unified Capacity–Locality Problem (UCLP): a decision framework for bounded locality, bounded information injection, and valid progress accounting in polynomial-time computation. Includes the canonical CutStrings benchmark and URF-ADMISSIBLE predicate.

Investigation of Whiplash stability effects in model refinement and complexity hierarchies with formal artifacts.

Final Wall (FOᵏ Locality) — terminal obstruction results for FOᵏ locality, proving rigidity walls and limits of refinement-based computation.

Python and LaTeX source code of my MSc thesis

Code written for lectures and homework in USC CSCI570-Analysis-of-Algorithms Course 🚀🚀🚀

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

Chronos–URF RR — reference implementation of Chronos entropy-depth bounds and rigidity results within the Unified Rigidity Framework.

Chronos–EntropyDepth — information-theoretic limits on refinement and computation; entropy depth bounds, certificates, and executable witnesses.

Unified Capacity–Locality Problem (UCLP): a formal decision framework for bounded locality, information capacity, and progress accounting in polynomial-time computation. Includes the canonical CutStrings benchmark and URF-ADMISSIBLE criteria.

URF Core — foundational axioms, definitions, and theorems of the Unified Rigidity Framework, serving as the minimal trusted base.

Rank Dichotomy Theorem for CAT(0) Cube Complexes (canonical)

P != NP

Terminal obstruction (Cyclone) for locality-bounded computation: overlap-rank BOM, AKR CPD₁ kernel, entropy-depth lower bounds, and Lean formalization toward P≠NP.

Terminal Rigidity Witness (ERB) — executable certificates demonstrating terminal rigidity and no-escape obstructions under bounded locality and capacity.

A Java and Python project that implements and analyzes Radix Sort for integers and strings using array-based buckets, tracking primitive operations and visualizing performance trends across varying input sizes.

A Minimum Spanning Tree with 30 nodes and vertices for optimizing Tokyo's railway station network using Prim's algorithm. This project uses both C++ and Python with run time analysis and manual calculations of MST.

Implementação de algoritmos de ordenação

:pencil: Solutions to the exercise sessions

This repository presents a constructive and complete proof of the P≠NP problem, based on structural separation and recursive unconstructibility. 本リポジトリは、構成的手法によりP≠NP問題を完全に証明した理論を収録しています。構成不能性と分離構造に基づく新たなアプローチです。

SubsetSum: a study on 'The Subset-Sum Problem'.