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

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

A Rust library for computational hard problem definitions and reductions

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.

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.

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.

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.

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

Python and LaTeX source code of my MSc thesis

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

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.

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

P != NP

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