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

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.

P ≠ NP via Ising Energy Landscape Fragmentation — OGP 0.00%, 35/35 checks, n = 50,000, SOS conjecture ⟹ P ≠ NP

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++)

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

Python and LaTeX source code of my MSc thesis

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

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

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

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

P != NP

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.

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.