Lectures for the "Problem Solving" Class at Nanjing University.
A command line tool for computational hard problems and their 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.
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 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
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.
Flagship executable URF/Chronos implementation with verified build and test surface
Rank Dichotomy Theorem for CAT(0) Cube Complexes (canonical)
Mathematics-Backed Peer to Peer Network β Rust node, marketplace, Lean 4 verified math
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 πππ
Trusted base of definitions, schemas, and verification artifacts for the Unified Rigidity Framework
Add a description, image, and links to the computational-complexity topic page so that developers can more easily learn about it.
To associate your repository with the computational-complexity topic, visit your repo's landing page and select "manage topics."