computational-complexity
There are 37 repositories under computational-complexity topic.
courses-at-nju-by-hfwei/problem-solving-class-lectures
Lectures for the "Problem Solving" Class at Nanjing University.
crate-crypto/qesa
Efficient zero-knowledge arguments in the discrete log setting, revisited
MichaelWehar/P-vs-NP-Community
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.
danieldotwav/Average-of-Levels-in-Binary-Tree
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.
taraokelly/Theory-Of-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.
iandinwoodie/trend-prof
A public copy of the trend-prof empirical computational complexity measurement tool
teresa-chow/42-push_swap
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.
zelhajou/ft_algo_push_swap
A program that sorts a stack of numbers using a minimal set of operations
morpheusthewhite/master-thesis
Python and LaTeX source code of my MSc thesis
ProFuSELab/DS-COCA
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++)
gtyrovolas/thesis
My thesis for my Masters degree in Mathematics and Computer Science
Kamii114/Travelling-Salseman-Problem_NearestNeighborSearch
This repository explores two optimization algorithms: the Traveling Salesman Problem (TSP) and Nearest Neighbor Search (NNS). It features Jupyter notebooks implementing brute-force solutions to both problems, utilizing Euclidean distance calculations and path visualizations. Ideal for learning about algorithm efficiency and optimization techniques.
LKEthridge/Numerical_Methods
A Numerical Methods project from TripleTen
luana-nakasuga/PesquisaOrdenacao
Implementação de algoritmos de ordenação
plesak/mipstarisre
Minerva University Bachelor Thesis Project: MIP* = RE
ProFuSELab/FH-CBF
This library provides a linear time and space algorithm for computing all the Fagin-Halpern conditional beliefs generated from consonant belief functions
raysas/algorithms-and-data-structures
Gym for your neurons
CristianAbrante/PrimitiveRecursiveFunctions
Implementation of a pow, using recursive primitive function in Java.
DauteRR/PushdownAutomaton
Pushdown automaton simulator developed as an assignment for Computational Complexity course :books: :computer:
DauteRR/TuringMachine
Turing Machine simulator developed as an assignment for Computational Complexity course :books: :computer:
FilipeLopesPires/SortingStrategies
Sorting Strategies: a study on the most famous sorting algorithms.
FilipeLopesPires/SubsetSum
SubsetSum: a study on 'The Subset-Sum Problem'.
Koltonix/comp110-worksheet-5
Christopher Robertson Submission (Worksheet 5 - COMP110)
lucianoscarpaci/Minimum_Spanning_Tree
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.
lucianoscarpaci/Randomized-Algorithm-Quicksort
This project implements an optimized version of the Quicksort algorithm in C++, using a randomized pivot selection (first or last index during the partition). Additionally, the project features a manual analysis of the algorithm's running time in the worst-case and average-case scenarios.
M3l3r0/Packetized
Packetized Machine Learning
michaelflppv/ged-approximation
This is a repository of the code used for the experimental work in my Bachelor thesis on Approximation Algorithms for Graph Edit Distance (GED). It includes implementations, benchmarking scripts, and evaluation methods for comparing GED approximation algorithms with exact computations.
Mk9207/-P-NP-Constructive-Proof-of-P-NP
This repository presents a constructive and complete proof of the P≠NP problem, based on structural separation and recursive unconstructibility. 本リポジトリは、構成的手法によりP≠NP問題を完全に証明した理論を収録しています。構成不能性と分離構造に基づく新たなアプローチです。
NICxKMS/interactive-merge-sort-visualizer
🔍 An interactive visualization tool for the Merge Sort algorithm, featuring dual-tree animations, step-by-step execution, zoom & pan controls, and educational insights.
RaulMurillo/OPT_UCM
Optimization course from Master in Computer Science at Complutense University of Madrid
Team7-2401/MIS-Project
This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem
TheMegistone4Ever/LPOps
Python project for analyzing simplex method complexity on LPs in canonical form. Tracks FLOPs, generates problems, fits models, visualizes with Matplotlib, and caches results. Builds on work by Pavlov, Kyselov, et al. Uses Nelder-Mead optimization and MSE loss to fit empirical data to theoretical models like Borgwardt, Smoothed, and Polynomial.
VictorDeGallegos/Complejidad-Computacional
Repositorio de tareas y prácticas de la asignatura Complejidad Computacional Facultad de Ciencias UNAM semestre 2023-1
WenHao1223/cpt212-asgn1
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.