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 program that sorts a stack of numbers using a minimal set of operations

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.

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++)

Python and LaTeX source code of my MSc thesis

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.

📝 Solutions to the exercise sessions

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

Implementação de algoritmos de ordenação

This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem

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.

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

SubsetSum: a study on 'The Subset-Sum Problem'.

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

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.

Christopher Robertson Submission (Worksheet 5 - COMP110)