Lectures for the "Problem Solving" Class at Nanjing University.
-
Updated
Jun 29, 2020 - TeX
Lectures for the "Problem Solving" Class at Nanjing University.
Efficient zero-knowledge arguments in the discrete log setting, revisited
📝 Solutions to the exercise sessions
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++)
This library provides a linear time and space algorithm for computing all the Fagin-Halpern conditional beliefs generated from consonant belief functions
SubsetSum: a study on 'The Subset-Sum Problem'.
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.
Sorting Strategies: a study on the most famous sorting algorithms.
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
Python and LaTeX source code of my MSc thesis
Implementação de algoritmos de ordenação
My thesis for my Masters degree in Mathematics and Computer Science
Packetized Machine Learning
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.
Minerva University Bachelor Thesis Project: MIP* = RE
Christopher Robertson Submission (Worksheet 5 - COMP110)
Optimization course from Master in Computer Science at Complutense University of Madrid
Implementation of a pow, using recursive primitive function in Java.
Add a description, image, and links to the computational-complexity topic page so that developers can more easily learn about it.
To associate your repository with the computational-complexity topic, visit your repo's landing page and select "manage topics."