A command line tool for computational hard problems and their reductions
-
Updated
May 25, 2026 - Rust
#
computational-complexity
Here are 58 public repositories matching this topic...
Lectures for the "Problem Solving" Class at Nanjing University.
course-materials algorithms logic linear-programming set-theory discrete-mathematics graph-theory group-theory lecture-notes number-theory abstract-algebra nanjing-university computational-complexity nju-courses discrete-probability
-
Updated
Jun 29, 2020 - TeX
Efficient zero-knowledge arguments in the discrete log setting, revisited
-
Updated
Mar 4, 2020 - Rust
Experimental Subset Sum solver for large integers using SQLite as an out-of-core storage engine.
computer-science cryptography algorithms datastructures fault-tolerance sqlite mitm python3 fintech cybersecurity discrete-mathematics software-architecture computational-complexity subset-sum high-precision fptas npcomplete backend-engineering outofcore
-
Updated
May 16, 2026 - Python
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.
polynomial-time computational-complexity non-determinism complexity-theory millennium-problems p-vs-np unsolved-problems
-
Updated
Oct 24, 2022
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.
queue cpp binary-tree memory-management tree-traversal computational-complexity level-order-traversal node-averaging
-
Updated
Jan 31, 2024 - C++
P ≠ NP via Ising Energy Landscape Fragmentation — OGP 0.00%, 35/35 checks, n = 50,000, SOS conjecture ⟹ P ≠ NP
gpu-computing ising-model computational-complexity 3sat spin-glass p-vs-np millennium-prize omega-24 overlap-gap-property
-
Updated
Apr 8, 2026 - TeX
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.
-
Updated
May 9, 2018 - Racket
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.
algorithms complexity sorting-algorithms greedy-algorithms 42born2code 42 42school computational-complexity 42cursus 42porto
-
Updated
Jan 9, 2025 - C
A public copy of the trend-prof empirical computational complexity measurement tool
-
Updated
Oct 27, 2021 - Perl
A program that sorts a stack of numbers using a minimal set of operations
-
Updated
Jan 31, 2025 - C
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++)
c-plus-plus algorithms data-structures computational-complexity dempster-shafer-theory dempsters-conditional fagin-halpern-conditional evidential-reasoning
-
Updated
Aug 14, 2020 - C++
Trackability regimes for single-cell perturbation prediction: LAOT, synthetic phase transitions, and biological benchmarks.
np-hard single-cell optimal-transport polynomial-time computational-complexity single-cell-rna-seq single-cell-analysis optimal-transport-algorithms perturbation-prediction icml-2026 linear-assignment laot scgen cellot
-
Updated
May 24, 2026 - Jupyter Notebook
Python and LaTeX source code of my MSc thesis
twitter reddit graph graph-algorithms linear-programming graph-mining polarization computational-complexity mixed-integer-programming complexity-theory polarization-mining approximability
-
Updated
Aug 25, 2021 - TeX
Code written for lectures and homework in USC CSCI570-Analysis-of-Algorithms Course 🚀🚀🚀
algorithms graph-algorithms dynamic-programming greedy-algorithms heaps tsp-problem computational-complexity matching-algorithm network-flows np-problems np-hard-problems
-
Updated
Dec 4, 2025 - C++
Mathematics-Backed Peer to Peer Network — Rust node, marketplace, Lean 4 verified math
rust marketplace blockchain cryptocurrency formal-verification computational-complexity layer1 web4 proof-of-useful-work np-problem lean4
-
Updated
May 25, 2026 - Rust
Trusted base of definitions, schemas, and verification artifacts for the Unified Rigidity Framework
reproducible-research information-theory logic mathematics verification graph-theory formal-methods invariants urf theoretical-computer-science formal-verification computational-complexity mathlib lean4 rigidity unified-rigidity-framework rigidity-theory core-axioms
-
Updated
May 19, 2026 - Python
Flagship executable URF/Chronos implementation with verified build and test surface
reproducible-research information-theory verification graph-theory chronos urf reference-implementation formal-verification sat computational-complexity complexity-theory expanders lean4 rigidity unified-rigidity-framework rigidity-theory entropy-depth
-
Updated
May 24, 2026 - Python
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
python research np-hard pattern-recognition tsp algorithm-selection combinatorial-optimization computational-complexity meta-learning traveling-salesman-problem
-
Updated
Mar 9, 2026 - Python
Improve this page
Add a description, image, and links to the computational-complexity topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the computational-complexity topic, visit your repo's landing page and select "manage topics."