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.

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 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.

A public copy of the trend-prof empirical computational complexity measurement tool

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 final degree testis about Tetris computational complexity

Python and LaTeX source code of my MSc thesis

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

This library provides a linear time and space algorithm for computing all the Fagin-Halpern conditional beliefs generated from consonant belief functions

📝 Solutions to the exercise sessions

Pushdown automaton simulator developed as an assignment for Computational Complexity course 📚 💻

Repositorio de tareas y prácticas de la asignatura Complejidad Computacional Facultad de Ciencias UNAM semestre 2023-1

Packetized Machine Learning

Implementação de algoritmos de ordenação

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.

My thesis for my Masters degree in Mathematics and Computer Science

Christopher Robertson Submission (Worksheet 5 - COMP110)

Optimization course from Master in Computer Science at Complutense University of Madrid