computational-complexity

A command line tool for computational hard problems and their reductions

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

Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks

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.

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.

Circuits, Proofs, and Algebra: research papers and reproducible code on complexity lower bounds, motivated by P vs NP and VP vs VNP.

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.

Research implementation of the Yang–Zhang 23-Wang-tile reduction: verified region construction, deterministic C solver, and independent tiling verification.

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

Reproducibility companion for claim–evidence consistency in labeled graphs: complexity, certificates, correction, graph algorithms, and deterministic validation.

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 public copy of the trend-prof empirical computational complexity measurement tool

A research laboratory for exploring P vs NP through small programs, counterexamples, and explicit proofs, with replayable SAT experiments and an LRAT-checked oracle.

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

Azeon is a public knowledge platform. Documentation on hard ideas, starting with P vs NP. Built from first principles, written while learning.

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

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.