computational-complexity

A command line tool for computational hard problems and their reductions

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

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

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

The Emergence Dynamics: A Paradigm of Continuous Measurement and Nondeterministic State Flows – Toward P versus NP and the Boundary of Computation. Core implementations: https://github.com/theparadigmgroup/EmergenceDynamicsCore. Derivatives: https://github.com/theparadigmgroup/OpenEvent. Embodied AI: https://github.com/theparadigmgroup/OpenStream.

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.

Position-Candidate-Hypothesis (PCH) is a theoretical paradigm for structural-statistical analysis of NP-complete problems.

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.

Trackability regimes for single-cell perturbation prediction: LAOT, synthetic phase transitions, and biological benchmarks.

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

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

An experimental greedy heuristic for graph 3-coloring using a custom Matrix Sorting Machine priority structure, with benchmarking and graph visualization.

Mathematics-Backed Peer to Peer Network — Rust node, marketplace, Lean 4 verified math

Official GitHub profile — Independent Researcher

A formal proof, in LaTeX, that 3-Partition is NP-complete in the strong sense, following the Garey and Johnson reduction chain. MAC coursework, UGR.

Python and LaTeX source code of my MSc thesis

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

a browser app that calculates the precise average and standard deviation of all the choices for the np-complete problems in polynomial time. It treats the problems as a thermal dynamic system and assign probabilities to witnesses using the Boltzmann distribution. The partition function is approximated using the entropy and a Taylor expansion.