There are 2 repositories under computational-complexity topic.
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.
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.
A public copy of the trend-prof empirical computational complexity measurement tool
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
Python and LaTeX source code of my MSc thesis
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++)
My thesis for my Masters degree in Mathematics and Computer Science
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.
A Numerical Methods project from TripleTen
Implementação de algoritmos de ordenação
Minerva University Bachelor Thesis Project: MIP* = RE
This library provides a linear time and space algorithm for computing all the Fagin-Halpern conditional beliefs generated from consonant belief functions
Gym for your neurons
Implementation of a pow, using recursive primitive function in Java.
Pushdown automaton simulator developed as an assignment for Computational Complexity course :books: :computer:
Turing Machine simulator developed as an assignment for Computational Complexity course :books: :computer:
Sorting Strategies: a study on the most famous sorting algorithms.
SubsetSum: a study on 'The Subset-Sum Problem'.
Christopher Robertson Submission (Worksheet 5 - COMP110)
Packetized Machine Learning
🔍 An interactive visualization tool for the Merge Sort algorithm, featuring dual-tree animations, step-by-step execution, zoom & pan controls, and educational insights.
Optimization course from Master in Computer Science at Complutense University of Madrid
This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem
Repositorio de tareas y prácticas de la asignatura Complejidad Computacional Facultad de Ciencias UNAM semestre 2023-1